NP-hardness of coloring $2$-colorable hypergraph with poly-logarithmically many colors.Amey BhangaleElectronic Colloquium on Computational Complexity (ECCC)（2018）引用 25|浏览8暂无评分AI 理解论文溯源树样例生成溯源树，研究论文发展脉络Chat Paper正在生成论文摘要
