限制信息从非自适应查询到NP

Yenjo Han, T. Thierauf
{"title":"限制信息从非自适应查询到NP","authors":"Yenjo Han, T. Thierauf","doi":"10.1109/SCT.1995.514859","DOIUrl":null,"url":null,"abstract":"We investigate classes of sets that can be decided by bounded truth-table reductions to an NP set in which evaluators do not have full access to the answers to the queries but get only restricted information such as the number of queries that are in the oracle set or even just this number modulo m, for some m/spl ges/2. We also investigate the case in which evaluators are nondeterministic. We locate all these classes within levels of the Boolean hierarchy, which allows us to compare the complexity of such classes. Our results show the various degrees to which the power of P or NP evaluators are affected as the restricted information that the evaluators get from the answers to the queries produced by generators is changed.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"121 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Restricted information from nonadaptive queries to NP\",\"authors\":\"Yenjo Han, T. Thierauf\",\"doi\":\"10.1109/SCT.1995.514859\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate classes of sets that can be decided by bounded truth-table reductions to an NP set in which evaluators do not have full access to the answers to the queries but get only restricted information such as the number of queries that are in the oracle set or even just this number modulo m, for some m/spl ges/2. We also investigate the case in which evaluators are nondeterministic. We locate all these classes within levels of the Boolean hierarchy, which allows us to compare the complexity of such classes. Our results show the various degrees to which the power of P or NP evaluators are affected as the restricted information that the evaluators get from the answers to the queries produced by generators is changed.\",\"PeriodicalId\":318382,\"journal\":{\"name\":\"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference\",\"volume\":\"121 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1995.514859\",\"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 Structure in Complexity Theory. Tenth Annual IEEE Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1995.514859","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们研究了一类可以由有界真值表约简到NP集来决定的集合,其中求值者不能完全访问查询的答案,而只能获得有限的信息,例如oracle集中的查询数,甚至只是这个数的模m,对于一些m/spl ges/2。我们还研究了评估器不确定的情况。我们将所有这些类定位在布尔层次结构的各个级别中,这允许我们比较这些类的复杂性。我们的结果显示,当评估器从生成器生成的查询的答案中获得的有限信息发生变化时,P或NP评估器的能力受到不同程度的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Restricted information from nonadaptive queries to NP
We investigate classes of sets that can be decided by bounded truth-table reductions to an NP set in which evaluators do not have full access to the answers to the queries but get only restricted information such as the number of queries that are in the oracle set or even just this number modulo m, for some m/spl ges/2. We also investigate the case in which evaluators are nondeterministic. We locate all these classes within levels of the Boolean hierarchy, which allows us to compare the complexity of such classes. Our results show the various degrees to which the power of P or NP evaluators are affected as the restricted information that the evaluators get from the answers to the queries produced by generators is changed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信