- 1、本文档共19页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Competing Provers Yield Improved Karp--Lipton Collapse Results #
Competing Provers Yield Improved Karp–Lipton Collapse Results?
Jin-Yi Cai Venkatesan T. Chakaravarthy
Department of Computer Sciences, University of Wisconsin, Madison, WI 53706, USA
Email: {jyc,venkat}@cs.wisc.edu
Lane A. Hemaspaandra Mitsunori Ogihara
Department of Computer Science, University of Rochester, Rochester, NY 14627, USA
Email: {lane,ogihara}@cs.rochester.edu
Technical Report URCS-TR-2001-759
September 17, 2001; revised November 2, 2002
Abstract
Via competing provers, we show that if a language A is self-reducible and has
polynomial-size circuits then SA2 = S2. Building on this, we strengthen the Ka?mper–
AFK Theorem, namely, we prove that if NP ? (NP ∩ coNP)/poly then the polynomial
hierarchy collapses to SNP∩coNP2 . We also strengthen Yap’s Theorem, namely, we prove
that if NP ? coNP/poly then the polynomial hierarchy collapses to SNP2 . Under the
same assumptions, the best previously known collapses were to ZPPNP and ZPPNP
NP
respectively ([KW98, BCK+94], building on [KL80, AFK89, Ka?m91, Yap83]). It is
known that S2 ? ZPP
NP [Cai01]. That result and its relativized version show that
our new collapses indeed improve the previously known results. Since the Ka?mper–
AFK Theorem and Yap’s Theorem are used in the literature as bridges in a variety
of results—ranging from the study of unique solutions to issues of approximation—our
results implicitly strengthen all those results.
Keywords: Structural complexity, competing provers, nonuniform complexity, sym-
metric alternation, Karp–Lipton Theorem, Yap’s Theorem, Ka?mper–AFK Theorem,
lowness.
1 Proving Collapses via Competing Provers
The symmetric alternation class S2 was introduced by Canetti [Can96] and Russell and Sun-
daram [RS98]. In one model that captures this notion, we have two all-powerful competing provers,
the Yes-Prover and the No-prover, and a polynomial-time verifier. Given an input string x, the
Yes-prover and the No-prover attempt to convince the verifier of x ∈ L and of x 6∈ L, respectiv
您可能关注的文档
- characteristics of stemflow for tall stewartia growing on a hillslope.pdf
- Characteristics and sources of chromophoric dissolved organic matter in lakes of the Yungui Plateau.pdf
- Characterization of Electrochemically Grown Crystalline CuInSe2 Thin Films.pdf
- Characterization of PM2.5 in the ambientair of Shanghaicity by analyzingindividualparticles.pdf
- Characterizations of essential ideals as operator modules over C-algebras.pdf
- Characterizing packet audio streams from internet multimedia applications.pdf
- Charge amplification concepts for direction-sensitive dark matter detectors.pdf
- Charge carriers of different origin in cuprates as revealed by experiment.pdf
- Charge collective modes in an incommensurately modulated cuprate.pdf
- Charge exchange for medium energy He and Ne ions in a large-angle collision at solid surfaces.pdf
文档评论(0)