Intersection suffices for Boolean hierarchy equivalence
From MaRDI portal
Recommendations
Cites work
- A relationship between difference hierarchies and relativized polynomial hierarchies
- BANISHING ROBUST TURING COMPLETENESS
- Complexity classes without machines: on complete languages for UP
- Downward Separation Fails Catastrophically for Limited Nondeterminism Classes
- Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete
- scientific article; zbMATH DE number 17529 (Why is no real title available?)
- scientific article; zbMATH DE number 512827 (Why is no real title available?)
- On computing Boolean connectives of characteristic functions
- On the unique satisfiability problem
- Relative complexity of checking and evaluating
- Separating complexity classes with tally oracles
- The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
- The Boolean Hierarchy I: Structural Properties
- The Boolean Hierarchy II: Applications
- The complexity of facets (and some facets of complexity)
- The complexity of theorem-proving procedures
- The difference and truth-table hierarchies for NP
- The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
- The polynomial-time hierarchy
This page was built for publication: Intersection suffices for Boolean hierarchy equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085737)