Hardness of approximating Σ2p minimization problems

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 465-474

  Umans, Christopher ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; OPTIMIZATION; POLYNOMIALS;

MINIMUM EQUIVALENT DISJUNCTIVE NORMAL FORM; SUCCINCT SET COVER;

COMPUTATIONAL COMPLEXITY;

EID: 0032606579     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)