Amplification with One NP Oracle Query

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.

Publication Title

Computational Complexity

Link to Full Text

Share

COinS