Pinpointing computation with modular queries in the Boolean hierarchy

DOI10.1007/3-540-62034-6_60zbMATH Open1541.68149MaRDI QIDQ6567782FDOQ6567782

Authors: Manindra Agrawal, Richard Beigel, Thomas Thierauf 

Publication date: 5 July 2024

Recommendations

• Bounded queries to SAT and the Boolean hierarchy
• Query Order
• Bounded Query Classes
• The Boolean Hierarchy I: Structural Properties
• Restricted information from nonadaptive queries to NP

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounded Query Classes
• The difference and truth-table hierarchies for NP
• The Boolean Hierarchy I: Structural Properties
• Bounded queries to SAT and the Boolean hierarchy
• A comparison of polynomial time reducibilities
• Complexity-Restricted Advice Functions
• Title not available (Why is that?)

This page was built for publication: Pinpointing computation with modular queries in the Boolean hierarchy

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