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

DOI10.1016/S0020-0190(98)00024-6zbMATH Open1078.68636OpenAlexW2090171172MaRDI QIDQ2583533FDOQ2583533

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

• Title not available (Why is that?)
• The polynomial-time hierarchy
• More complicated questions about maxima and minima, and some closures of NP
• Bounded Query Classes
• The difference and truth-table hierarchies for NP
• The Boolean Hierarchy I: Structural Properties
• Bounded queries to SAT and the Boolean hierarchy
• Query Order
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On boolean lowness and boolean highness
• A relationship between difference hierarchies and relativized polynomial hierarchies
• Query order in the polynomial hierarchy
• Bounded queries, approximations, and the Boolean hierarchy

Cited In (5)

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

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)