37 search results - page 1 / 8 » The Hardness of 3 - Uniform Hypergraph Coloring |
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
STOC
2003
ACM
13 years 9 months ago
2003
ACM
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...
IANDC
2007
13 years 4 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
FOCS
2010
IEEE
13 years 2 months ago
2010
IEEE
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...