Sciweavers

Share
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
8 years 9 months ago
A new multilayered PCP and the hardness of hypergraph vertex cover
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
Irit Dinur, Venkatesan Guruswami, Subhash Khot, Od...
books