The 1-versus-2 queries problem revisited

DOI10.1007/S00224-008-9126-XzbMATH Open1203.68052OpenAlexW2007849544MaRDI QIDQ970102FDOQ970102

Rahul Tripathi

Publication date: 10 May 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9126-x

Recommendations

• The 1-Versus-2 Queries Problem Revisited
• On zero error algorithms having oracle access to one query
• Computing and Combinatorics
• scientific article; zbMATH DE number 1335876
• scientific article; zbMATH DE number 638299

zbMATH Keywords

computational complexitycomplexity classesbounded querieszero-error algorithms

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Title not available (Why is that?)
• Amplification with one \textsf{NP} oracle query
• The landscape of communication complexity classes
• On zero error algorithms having oracle access to one query
• Title not available (Why is that?)
• The 1-Versus-2 Queries Problem Revisited
• Title not available (Why is that?)

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 Q970102)