On the query complexity of clique size and maximum satisfiability

DOI10.1006/jcss.1996.0070zbMath0859.68037OpenAlexW2123376621MaRDI QIDQ1816736

Richard Chang

Publication date: 31 March 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1996.0070

zbMATH Keywords

maximum cliquebounded query complexityClique Size

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Bounded queries, approximations, and the Boolean hierarchy

This page was built for publication: On the query complexity of clique size and maximum satisfiability