Skip to main content
SpringerLink
Log in

Amplification with One NP Oracle Query

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract

We provide a complete picture of the extent to which amplification of success probability is possible for randomized algorithms having access to one NP oracle query, in the settings of two-sided, onesided, and zero-sided error. We generalize this picture to amplifying one-query algorithms with q-query algorithms, and we show our inclusions are tight for relativizing techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Richard Beigel (1991). Bounded Queries to SAT and the Boolean Hierarchy. Theoretical Computer Science 84(2), 199–223.

  • Jin-Yi Cai & Venkatesan Chakaravarthy (2006). On Zero Error Algorithms Having Oracle Access to One Query. Journal of Combinatorial Optimization 11(2), 189–202.

  • Richard Chang & Suresh Purini (2008). Amplifying ZPPSAT[1] and the Two Queries Problem. In Proceedings of the 23rd Conference on Computational Complexity (CCC), 41–52. IEEE.

  • Mika Göös, Toniann Pitassi & Thomas Watson (2018). The Landscape of Communication Complexity Classes. Computational Complexity 27(2), 245–304.

  • Pankaj Rohatgi (1995). Saving Queries with Randomness. Journal of Computer and System Sciences 50(3), 476–492.

  • Larry Stockmeyer (1985). On Approximation Algorithms for #P. SIAM Journal on Computing 14(4), 849–861.

  • Rahul Tripathi (2010). The 1-Versus-2 Queries Problem Revisited. Theory of Computing Systems 46(2), 193–221.

  • Nikolai Vereshchagin (1995). Lower Bounds for Perceptrons Solving some Separation Problems and Oracle Separation of AM from PP. In Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems (ISTCS), 46–51. IEEE.

  • Nikolai Vereshchagin (1999). Relativizability in Complexity Theory. In Provability, Complexity, Grammars, volume 192 of AMS Translations, Series 2, 87–172. American Mathematical Society.

  • Thomas Watson (2019). Amplification with One NP Oracle Query. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP), Track A, 96:1–96:13. Schloss Dagstuhl.

  • Thomas Watson (2020). A ZPPNP[1] Lifting Theorem. ACM Transactions on Computation Theory 12(4), 27:1–27:20.

Download references

Acknowledgements

I thank anonymous referees for their comments. This work was supported by NSF grants CCF-1657377 and CCF-1942742. An extended abstract of this paper was published as Watson (2019).

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Memphis, Memphis, USA

    Thomas Watson

Authors
  1. Thomas Watson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Watson.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Watson, T. Amplification with One NP Oracle Query. comput. complex. 31, 3 (2022). https://doi.org/10.1007/s00037-021-00219-w

Download citation

  • Received:

  • Published:

  • DOI: https://doi.org/10.1007/s00037-021-00219-w

Keywords

Subject classification

Search

Navigation