Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Amplification with One NP Oracle Query

Amplification with One NP Oracle Query We provide a complete picture of the extent to which amplificationof success probability is possible for randomized algorithmshaving access to one NP oracle query, in the settings of two-sided, onesided,and zero-sided error. We generalize this picture to amplifyingone-query algorithms with q-query algorithms, and we show our inclusionsare tight for relativizing techniques. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Computational Complexity Springer Journals

Amplification with One NP Oracle Query

Computational Complexity , Volume 31 (1) – Jun 1, 2022

Loading next page...
 
/lp/springer-journals/amplification-with-one-np-oracle-query-863FIluT8f

References (11)

Publisher
Springer Journals
Copyright
Copyright © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2022
ISSN
1016-3328
eISSN
1420-8954
DOI
10.1007/s00037-021-00219-w
Publisher site
See Article on Publisher Site

Abstract

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

Journal

Computational ComplexitySpringer Journals

Published: Jun 1, 2022

Keywords: Amplification; NP; oracle; 68Q15

There are no references for this article.