LIPIcs.ICALP.2019.96.pdf
- Filesize: 0.52 MB
- 13 pages
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, one-sided, 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.
Feedback for Dagstuhl Publishing