Relativized questions involving probabilistic algorithms

Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI:10.1145/800133.804363

C. Rackoff

引用次数: 6

Abstract

Let R @@@@ NP be the collection of languages L such that for some polynomial time computable predicate P(x,y) and constant k, L = {x|@@@@y, |y|=|x|k,P(x,y)} = {x|@@@@ at least 2|x|k−1 values of y, |y|=|x|k,P(x,y)}. Let U @@@@ NP be the collection of languages L such that for some polynomial time computable predicate P(x,y) and constant k, L = {x|@@@@y,|y|=|x|k,P(x,y)}= {x|@@@@ unique y, |y|=|x|k,p(x,y)}. Let RA,UA, PA,NPA,CO-NPA be the relativization of these classes with respect to an oracle A as in [ 5 ]. Then for some oracle E (NPE @@@@ CO-NPE) = UE = RE = PE @@@@ NPE while for some other oracle D CO-NPD = NPD = UD = RD @@@@ PD.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

涉及概率算法的相对问题

设R @@@@ NP是语言L的集合，使得对于某个多项式时间可计算谓词P(x,y)和常数k, L = {x|@@@@y， |y|=|x|k,P(x,y)} = {x|@@@@至少有2个|x|k−1个y的值，|y|=|x|k,P(x,y)}。设U @@@@ NP是语言L的集合，使得对于某个多项式时间可计算谓词P(x,y)和常数k, L = {x|@@@@y，|y|=|x|k,P(x,y)}= {x|@@@@唯一y，|y|=|x|k,P(x,y)}。设RA,UA, PA,NPA,CO-NPA为这些类相对于oracle A的相对化，如[5]所示。然后，对于某些oracle E (NPE @@@@ CO-NPE) = UE = RE = PE @@@@ NPE，而对于另一些oracle D CO-NPD = NPD = UD = RD @@@@ PD。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings of the tenth annual ACM symposium on Theory of computing

自引率

0.00%

发文量

期刊最新文献

On the parallel evaluation of multivariate polynomials An analysis of the full alpha-beta pruning algorithm Data type specification: Parameterization and the power of specification techniques Relativized questions involving probabilistic algorithms Switching functions whose monotone complexity