The 1-Versus-2 Queries Problem Revisited

DOI10.1007/978-3-540-77120-3_14zbMATH Open1193.68118OpenAlexW2277688569MaRDI QIDQ5387752FDOQ5387752

Authors Rahul Tripathi 

Publication date 27 May 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77120-3_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• The 1-versus-2 queries problem revisited
• scientific article; zbMATH DE number 1947429
• A dichotomy in the complexity of consistent query answering for queries with two atoms
• Towards better separation between deterministic and randomized query complexity
• Extending Downward Collapse from 1-versus-2 Queries tom-versus-m+ 1 Queries
• Efficient and optimal query answering on independent schemes
• \(Q\)-ary search with one Lie and bi-interval queries
• A trichotomy in the complexity of counting answers to conjunctive queries
• Separation between deterministic and randomized query complexity

Cites Work

• A Downward Collapse within the Polynomial Hierarchy
• A relationship between difference hierarchies and relativized polynomial hierarchies
• Competing provers yield improved Karp-Lipton collapse results
• Extending Downward Collapse from 1-versus-2 Queries tom-versus-m+ 1 Queries
• More on BPP and the polynomial-time hierarchy
• Oblivious Symmetric Alternation
• On computing Boolean connectives of characteristic functions
• On zero error algorithms having oracle access to one query
• Oracles and queries that are sufficient for exact learning
• Proving SAT does not have small circuits with an application to the two queries problem
• Some Results on Average-Case Hardness Within the Polynomial Hierarchy
• Some consequences of non-uniform conditions on uniform classes
• Symmetric alternation captures BPP
• The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
• The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
• The complexity of optimization problems
• Two queries
• \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\)

Cited In (5)

• The two queries assumption and Arthur-Merlin classes
• The 1-versus-2 queries problem revisited
• On zero error algorithms having oracle access to one query
• Two queries
• Title not available (Why is no real title available?)

This page was built for publication: The 1-Versus-2 Queries Problem Revisited

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