scientific article; zbMATH DE number 1543293

MaRDI QIDQ4520757zbMATH OpenFDO

Authors Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel

Publication date 27 February 2001

Full work available at URL http://www.jucs.org/jucs_4_6/query_order_and_the

zbMATH Keywords

ordered computationquery order

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Query order in the polynomial hierarchy
• scientific article; zbMATH DE number 1091107
• Bounding queries in the analytic polynomial-time hierarchy
• Query Order
• Commutative queries

Cited in

(9)

• Generating polynomial orderings
• Reducing the number of solutions of NP functions
• Commutative queries
• Query-monotonic Turing reductions
• Query Order
• scientific article; zbMATH DE number 1091107 (Why is no real title available?)
• Query order in the polynomial hierarchy
• The query complexity of order-finding
• Lower bounds and the hardness of counting properties

This page was built for publication:

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