当前位置:
X-MOL 学术
›
Comput. Complex.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Amplification with One NP Oracle Query
computational complexity ( IF 1.4 ) Pub Date : 2022-02-05 , DOI: 10.1007/s00037-021-00219-w Thomas Watson 1
中文翻译:
使用一个 NP Oracle 查询进行放大
更新日期:2022-02-05
computational complexity ( IF 1.4 ) Pub Date : 2022-02-05 , DOI: 10.1007/s00037-021-00219-w Thomas Watson 1
Affiliation
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.
中文翻译:
使用一个 NP Oracle 查询进行放大
我们提供了在双边、单边和零边错误的设置中,对于可以访问一个NP预言机查询的随机算法,成功概率的放大程度的完整图片。我们将这张图片推广到使用 q-query 算法放大单查询算法,并且我们表明我们的包含对于相对化技术来说是紧密的。