scientific article; zbMATH DE number 1335876

MaRDI QIDQ4258567zbMATH OpenFDO

Authors Harry Buhrman, Lance Fortnow

Publication date 4 May 2000

Mathematics Subject Classification ID

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

Recommendations

• Two queries
• Proving SAT does not have small circuits with an application to the two queries problem
• Bounded queries to SAT and the Boolean hierarchy
• The 1-Versus-2 Queries Problem Revisited

Cited in

(6)

• The two queries assumption and Arthur-Merlin classes
• The 1-versus-2 queries problem revisited
• Proving SAT does not have small circuits with an application to the two queries problem
• scientific article; zbMATH DE number 2080645 (Why is no real title available?)
• Two queries
• Bounded queries, approximations, and the Boolean hierarchy

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4258567)