Searching for "Approximate Hypergraph Coloring." – sorted by Relevance.
-
Approximate hypergraph coloring, in
- Approximate Hypergraph Coloring Noga Alon 1 Pierre Kelsen 2 Sanjeev Mahajan 3 Hariharan Ramesh 4
- Cited by 6 (1 self) – Add To MetaCart
-
Hardness of Approximate Hypergraph Coloring
- Hardness of Approximate Hypergraph Coloring Venkatesan Guruswami y Johan Hastad z Madhu Sudan
- Cited by 28 (3 self) – Add To MetaCart
-
Hardness of Approximate Hypergraph Coloring
- Hardness of Approximate Hypergraph Coloring Venkatesan Guruswami Johan Hastad y Madhu Sudan
- Add To MetaCart
-
Abstract
- of approximate hypergraph coloring. The hardness results for decision trees, as well as the new upper bounds
- Add To MetaCart
-
Awards
- . Venkatesan Guruswami, Johan H˚astad, and Madhu Sudan, “Hardness of approximate hypergraph coloring,” SIAM
- Add To MetaCart
-
A new multilayered PCP and the hardness of hypergraph vertex cover
- that this "bipartiteness" flaw naturally arises in other settings as well. One example is approximate hypergraph coloring
- Cited by 32 (8 self) – Add To MetaCart

