A downward translation in the polynomial hierarchy
From MaRDI portal
Publication:5048934
Recommendations
Cites work
- scientific article; zbMATH DE number 3930351 (Why is no real title available?)
- scientific article; zbMATH DE number 17529 (Why is no real title available?)
- A relationship between difference hierarchies and relativized polynomial hierarchies
- Defying upward and downward separation
- Downward translations of equality
- Limitations of the upward separation technique
- Relativized Polynomial Time Hierarchies Having Exactly K Levels
- STRONG SEPARATIONS FOR THE BOOLEAN HIERARCHY OVER RP
- Sparse sets in NP-P: EXPTIME versus NEXPTIME
- Tally languages and complexity classes
- The Boolean Hierarchy I: Structural Properties
- The Boolean Hierarchy II: Applications
- The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
- The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
- The difference and truth-table hierarchies for NP
- Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
- Upward separation for FewP and related classes
- BPP has subexponential time simulations unless EXPTIME has publishable proofs
Cited in
(3)
This page was built for publication: A downward translation in the polynomial hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048934)