{"title":"涉及概率算法的相对问题","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":"{\"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}","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
摘要
设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。
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.