Query order in the polynomial hierarchy
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1543293
- Polynomial path orders
- Generating polynomial orderings
- Polynomials and operator orderings
- scientific article; zbMATH DE number 3935185
- Search Techniques for Rational Polynomial Orders
- Polynomial queries to relational data bases
- On the computational complexity of the order polynomial
- The query complexity of order-finding
- The complexity of higher-order queries
Cites work
- [[:Publication:1387830|\(R_{1-tt}^Template:\mathcal SN\)(NP) distinguishes robust many-one and Turing completeness]]
- A downward translation in the polynomial hierarchy
- A relationship between difference hierarchies and relativized polynomial hierarchies
- Bounded Query Classes
- Commutative queries
- scientific article; zbMATH DE number 578252 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 719756 (Why is no real title available?)
- scientific article; zbMATH DE number 1414285 (Why is no real title available?)
- PP is closed under truth-table reductions
- Query Order
- Query order in the polynomial hierarchy
- The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
- The Boolean Hierarchy I: Structural Properties
- The difference and truth-table hierarchies for NP
- The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
Cited in
(7)- Generating polynomial orderings
- Commutative queries
- A note on parallel queries and the symmetric-difference hierarchy.
- Query Order
- scientific article; zbMATH DE number 1091107 (Why is no real title available?)
- scientific article; zbMATH DE number 1543293 (Why is no real title available?)
- Query order in the polynomial hierarchy
This page was built for publication: Query order in the polynomial hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055937)
