On the query complexity of clique size and maximum satisfiability

Proceedings of the IEEE Annual Structure in Complexity Theory Conference

Volumn , Issue , 1994, Pages 31-42

  Chang, Richard ^a  

^a UNIVERSITY OF MARYLAND BALTIMORE COUNTY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; EQUIVALENCE CLASSES; FUNCTION EVALUATION; GRAPH THEORY; MATHEMATICAL MODELS; TURING MACHINES;

CLIQUE SIZE; MAXIMUM SATISFIABILITY; QUERY COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0028562844     PISSN: 10636870     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)