Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

FOCS
2000
IEEE

favoriteEmaildiscussreport

90views Theoretical Computer Science» more FOCS 2000»

Hardness of Approximate Hypergraph Coloring

13 years 9 months ago

Hardness of Approximate Hypergraph Coloring

Download www.csc.kth.se

Venkatesan Guruswami, Johan Håstad, Madhu Su

Real-time Traffic

FOCS 2000 | Theoretical Computer Science |

claim paper

Related Content

» The Hardness of 3 Uniform Hypergraph Coloring

» Hardness of fully dense problems

» Strong Colorings of Hypergraphs

» Approximating coloring and maximum independent sets in 3uniform hypergraphs

» A new multilayered PCP and the hardness of hypergraph vertex cover

» Approximate MinMax Theorems of Steiner RootedOrientations of Hypergraphs

» On the complexity of approximating kset packing

» Conditional hardness for approximate coloring

» Generalized hypertree decompositions nphardness and tractable variants

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	FOCS
Authors	Venkatesan Guruswami, Johan Håstad, Madhu Sudan

Comments (0)