A note on parallel queries and the symmetric-difference hierarchy.

DOI10.1016/S0020-0190(98)00024-6MaRDI QIDQ2583533zbMATH OpenOpenAlexFDO

Authors K. W. Wagner

Publication date 17 January 2006

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(98)00024-6

zbMATH Keywords

Boolean hierarchyParallel queriesPlus hierarchyQuery orderSymmetric-difference hierarchy

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)

Cites work

• scientific article; zbMATH DE number 3930351 (Why is no real title available?)
• scientific article; zbMATH DE number 3988706 (Why is no real title available?)
• scientific article; zbMATH DE number 3799016 (Why is no real title available?)
• scientific article; zbMATH DE number 1414285 (Why is no real title available?)
• A relationship between difference hierarchies and relativized polynomial hierarchies
• Bounded Query Classes
• Bounded queries to SAT and the Boolean hierarchy
• Bounded queries, approximations, and the Boolean hierarchy
• More complicated questions about maxima and minima, and some closures of NP
• On boolean lowness and boolean highness
• Query Order
• Query order in the polynomial hierarchy
• The Boolean Hierarchy I: Structural Properties
• The difference and truth-table hierarchies for NP
• The polynomial-time hierarchy

Cited in

(5)

• SELF-SPECIFYING MACHINES
• Reducing the number of solutions of NP functions
• Fine hierarchies via Priestley duality
• A reducibility for the dot-depth hierarchy
• Fine hierarchies and m-reducibilities in theoretical computer science

This page was built for publication: A note on parallel queries and the symmetric-difference hierarchy.

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