Hardness of approximate hypergraph coloring

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 149-158

  Guruswami, Venkatesan ^a   Hastad, Johan ^a   Sudan, Madhu ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HYPERGRAPH COLORING; SUPER-CONSTANT COVERING COMPLEXITY;

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; QUERY LANGUAGES; RANDOM PROCESSES; THEOREM PROVING;

COMPUTER SCIENCE;

EID: 0034504709     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2001.959967     Document Type: Conference Paper

References (26)