{"title":"Amplification with One NP Oracle Query","authors":"Thomas Watson","doi":"10.4230/LIPIcs.ICALP.2019.96","DOIUrl":null,"url":null,"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.","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"31 1","pages":"1-47"},"PeriodicalIF":0.7000,"publicationDate":"2022-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Complexity","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.4230/LIPIcs.ICALP.2019.96","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 3
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.
期刊介绍：
computational complexity presents outstanding research in computational complexity. Its subject is at the interface between mathematics and theoretical computer science, with a clear mathematical profile and strictly mathematical format.
The central topics are:
Models of computation, complexity bounds (with particular emphasis on lower bounds), complexity classes, trade-off results
for sequential and parallel computation
for "general" (Boolean) and "structured" computation (e.g. decision trees, arithmetic circuits)
for deterministic, probabilistic, and nondeterministic computation
worst case and average case
Specific areas of concentration include:
Structure of complexity classes (reductions, relativization questions, degrees, derandomization)
Algebraic complexity (bilinear complexity, computations for polynomials, groups, algebras, and representations)
Interactive proofs, pseudorandom generation, and randomness extraction
Complexity issues in:
crytography
learning theory
number theory
logic (complexity of logical theories, cost of decision procedures)
combinatorial optimization and approximate Solutions
distributed computing
property testing.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
