Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon)Irit Dinur,Venkatesan Guruswami,Subhash KhotElectronic Colloquium on Computational Complexity (ECCC)（2002）引用 28|浏览14暂无评分关键词vertex coverAI 理解论文溯源树样例生成溯源树，研究论文发展脉络Chat Paper正在生成论文摘要
