Relativized questions involving probabilistic algorithms

C. Rackoff
{"title":"Relativized questions involving probabilistic algorithms","authors":"C. Rackoff","doi":"10.1145/800133.804363","DOIUrl":null,"url":null,"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.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the tenth annual ACM symposium on Theory of computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800133.804363","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 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.
涉及概率算法的相对问题
设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分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信