The polynomial-time hierarchy

1976/10/01 by Larry J. Stockmeyer · 11 citations

paper · doi:10.1016/0304-3975(76)90061-x

Cited by

• Linear Decision Tree Policies for Integer Linear Programs
• Characterizing the Exponential-Space Hierarchy Via Partial Fixpoints
• Robust single-stage selection problems with budgeted interval uncertainty
• On the Pure Quantum Polynomial Hierarchy and Quantified Hamiltonian Complexity
• Recent quantum runtime (dis)advantages
• Valid Inequalities for Mixed Integer Bilevel Linear Optimization Problems
• On the Secret Protection Problem in Discrete-Event Systems
• On Kernelization with Access to NP-Oracles
• Repairing General Game Descriptions (extended version)
• Who Wins the Multi-Structural Game?
• Complexity of Faceted Explanations in Propositional Abduction