Skip to content

NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors.

Amey Bhangale

VenueA*ICALP
Year2018
ProceedingsICALP

Browse the full ICALP paper archive.