发布求助
文献互助 智能选刊 最新文献

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory最新文献

筛选
英文 中文
Space lower-bounds for pseudorandom-generators 伪随机发生器的空间下界
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315805
Xiangdong Yu, M. Yung
{"title":"Space lower-bounds for pseudorandom-generators","authors":"Xiangdong Yu, M. Yung","doi":"10.1109/SCT.1994.315805","DOIUrl":"https://doi.org/10.1109/SCT.1994.315805","url":null,"abstract":"Pseudorandom generation is a fundamental notion with many applications such as cryptography and deterministic simulation of random computation. A strong pseudorandom generator w.r.t. a tester class C is one that will \"fool\" any Turing-test in C to \"believe\" its output is truly random. We establish the first lower-bounds on the space complexity of general pseudorandom generators (namely, generators with no restrictions on their access to the input seed) which are strong w.r.t the typical time-/space-bounded classes of testers.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"28 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120814913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Using bounded query classes to separate classes in the exponential time hierarchy from classes in PH 使用有界查询类将指数时间层次结构中的类与PH中的类分开
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315818
Sarah Mocas
{"title":"Using bounded query classes to separate classes in the exponential time hierarchy from classes in PH","authors":"Sarah Mocas","doi":"10.1109/SCT.1994.315818","DOIUrl":"https://doi.org/10.1109/SCT.1994.315818","url":null,"abstract":"We are interested in separating classes in the exponential time hierarchy, EXPH, from classes in the polynomial time hierarchy, PH. We show that for any fixed integer c, P/sup NP[O(n(c/)])/spl sube/NEXP. This improves a previous result by B. Fu, H. Li and Y. Zhong (1992). Further, we generalize this separation to related levels of PH and EXPH, showing that for any fixed integer c and i/spl ges/1, /spl Deltasub isup P[O(n(c/)])/spl subespl Sigmasub i-1sup EXP/. This improves the long standing separations which result from the relativization of the time hierarchy theorem. Related results for function classes are also considered.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124051145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Logspace and logtime leaf languages 日志空间和日志时间叶语言
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315799
Birgit Jenner, P. McKenzie, D. Thérien
{"title":"Logspace and logtime leaf languages","authors":"Birgit Jenner, P. McKenzie, D. Thérien","doi":"10.1109/SCT.1994.315799","DOIUrl":"https://doi.org/10.1109/SCT.1994.315799","url":null,"abstract":"Leaf languages were used in the context of polynomial time computation to capture complexity classes and to study machine-independent relativizations. In this paper, the expressibility of the leaf language mechanism is investigated in the contexts of logarithmic space and of logarithmic time computation.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"97 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134118997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 56
Polynomial time truth-table reductions to p-selective sets p选择集的多项式时间真值表约简
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315821
Manindra Agrawal, V. Arvind
{"title":"Polynomial time truth-table reductions to p-selective sets","authors":"Manindra Agrawal, V. Arvind","doi":"10.1109/SCT.1994.315821","DOIUrl":"https://doi.org/10.1109/SCT.1994.315821","url":null,"abstract":"We make an elaborate analysis of the intervals defined by the ordered list of queries to the p-selective set. It turns out that the properties we derive are strong enough to get a collapse to P for several complexity classes, assuming that they are quasi-linear truth-table reducible (or in some cases o(logn)-tt reducible) to a p-selective set. More specifically, for any class /spl Kscrspl isin/{NP, PP, C=P, /spl oplus/P) we show that if /spl Kscr/ is quasi-linear truth-table reducible to a p-selective set then /spl Kscr/=P. For other Mod/sub k/P classes (k>2) we show that if Mod/sub k/P is o(log n)-truth-table reducible to a p-selective set then Mod/sub k/P=P.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117212417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 31
On the isomorphism problem for weak reducibilities 弱可约性的同构问题
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-24 DOI: 10.1109/SCT.1994.315790
Manindra Agrawal
{"title":"On the isomorphism problem for weak reducibilities","authors":"Manindra Agrawal","doi":"10.1109/SCT.1994.315790","DOIUrl":"https://doi.org/10.1109/SCT.1994.315790","url":null,"abstract":"The isomorphism conjecture states that all NP-complete sets are polynomial-time isomorphic while the encrypted complete set conjecture states that there is a p-one-way function f and an NP-complete set A such that A and f(A) are not polynomial-time isomorphic. We investigate these two conjectures for reducibilities weaker than polynomial-time. We show that: 1. Relative to reductions computed by one-way logspace DTMs, both the conjectures are false. 2. Relative to reductions computed by one-way logspace NTMs, the isomorphism conjecture is true. 3. Relative to reductions computed by multi-head, oblivious logspace DTMs, crypted complete set conjecture is false. 4. Relative to reductions computed by constant-scan logspace DTMs, the encrypted complete set conjecture is true. We also show that the complete degrees for NP under the latter two reducibilities coincide.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133069490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信