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

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

筛选
英文 中文
The complexity world below logarithmic space 对数空间下的复杂度世界
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315816
M. Liskiewicz, R. Reischuk
{"title":"The complexity world below logarithmic space","authors":"M. Liskiewicz, R. Reischuk","doi":"10.1109/SCT.1994.315816","DOIUrl":"https://doi.org/10.1109/SCT.1994.315816","url":null,"abstract":"Investigates space complexity classes defined by Turing machines that use less than logarithmic space. Because of the limited counting ability of such machines, most of the standard simulation techniques do not work for sublogarithmic space classes. However, machines with such little space may still be quite powerful. Therefore, it was not obvious how to obtain analogs for inclusion and separation results known for classes above logspace. We review known facts about the sublogarithmic space world and present several new results which show that these classes really behave differently, e.g. certain closure properties do not hold. The restricted power of these machines makes it possible to prove explicit separations-even for alternating complexity classes-by combinatorial arguments, and to obtain a hierarchy of non-relativized complexity classes without any unproven assumption. We also discuss upward and downward translation issues. Finally, these complexity classes are related to other classes within /spl Pscr/, in particular to context-free languages.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"AES-18 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":"126543885","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}
引用次数: 9
A direct product theorem 直积定理
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315814
R. Impagliazzo, R. Raz, A. Wigderson
{"title":"A direct product theorem","authors":"R. Impagliazzo, R. Raz, A. Wigderson","doi":"10.1109/SCT.1994.315814","DOIUrl":"https://doi.org/10.1109/SCT.1994.315814","url":null,"abstract":"Gives a general setting in which the complexity (or quality) of solving two independent problems is the product of the associated individual complexities. The authors then derive from this setting several concrete results of this type for decision trees and communication complexity.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"4 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":"131351623","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}
引用次数: 23
Towards the parallel repetition conjecture 走向平行重复猜想
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315794
O. Verbitsky
{"title":"Towards the parallel repetition conjecture","authors":"O. Verbitsky","doi":"10.1109/SCT.1994.315794","DOIUrl":"https://doi.org/10.1109/SCT.1994.315794","url":null,"abstract":"We consider the behavior of the error probability of a two-prover one-round interactive protocol repeated n times in parallel. We point out the connection of this problem with the density form of Hales-Jewett's theorem in Ramsey theory. This allows us to show that the error probability converges to 0 as n/spl rarrspl infin/.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"40 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":"124249922","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}
引用次数: 51
On the structure of complete sets 关于完备集的结构
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315811
H. Buhrman, L. Torenvliet
{"title":"On the structure of complete sets","authors":"H. Buhrman, L. Torenvliet","doi":"10.1109/SCT.1994.315811","DOIUrl":"https://doi.org/10.1109/SCT.1994.315811","url":null,"abstract":"The many types of resource-bounded reductions that are both an object of study and a research tool in structural complexity theory have given rise to a large variety of completeness notions. A complete set in a complexity class is a manageable object that represents the structure of the entire class. The study of its structure can reveal properties that are general in that the complexity class, and the study of the structure of complete sets in different classes, can reveal secrets about the relation between these classes. Research into all sorts of aspects and properties of complete sets has been and will be a major topic in structural complexity theory. In this expository paper, we review the progress that has been made in recent years on selected topics in the study of complete sets.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"22 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":"121196282","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}
引用次数: 50
Test instance generation for promised NP search problems 为承诺的NP搜索问题测试实例生成
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315803
O. Watanabe
{"title":"Test instance generation for promised NP search problems","authors":"O. Watanabe","doi":"10.1109/SCT.1994.315803","DOIUrl":"https://doi.org/10.1109/SCT.1994.315803","url":null,"abstract":"We discuss the problem of generating test instances for promised NP search problems. A technical framework is proposed for studying this problem, and it is shown that all known distNP-hard search problems are \"complete\" for test instance generation problems.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"144 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":"116431959","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}
引用次数: 8
Constructive separation of classes of indistinguishable ensembles 不可区分的集合类的建设性分离
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315804
Bernd Meyer
{"title":"Constructive separation of classes of indistinguishable ensembles","authors":"Bernd Meyer","doi":"10.1109/SCT.1994.315804","DOIUrl":"https://doi.org/10.1109/SCT.1994.315804","url":null,"abstract":"We construct ensembles that separate the classes of algorithmically, circuit, statistically, and perfect indistinguishable ensembles without cryptographic assumptions and present a generally usable technique for efficient deterministic simulation of resource bounded probabilistic Turing machines.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"1 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":"130464010","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}
引用次数: 5
Polynomial-time membership comparable sets 多项式时间隶属可比集
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315823
M. Ogihara
{"title":"Polynomial-time membership comparable sets","authors":"M. Ogihara","doi":"10.1109/SCT.1994.315823","DOIUrl":"https://doi.org/10.1109/SCT.1994.315823","url":null,"abstract":"The paper introduces and studies a notion called polynomial-time membership comparable sets, which is a generalization of P-selective sets. For a function g, a set A is called polynomial-time g-membership comparable if there is a polynomial-time computable function f such that for any x/sub 1/,...,x/sub m/ with m/spl ges/g(max{|x/sub 1/|,...,|x/sub m/|}), outputs b/spl isin/{0,1}/sup m/ such that (A(x/sub 1/),...A(x/sub m/))/spl ne/b. It is shown for each C chosen from {PSPACE, UP, FewP, NP, C=P, PP, MOD/sub 2/P, MOD/sub 3/P,...}, that if all of C are polynomial-time c(log n)-membership comparable for some fixed constant c<1, then C=P. As a corollary, it is shown that if there is same constant c<1 such that all of C are polynomial-time n/sup c/-truth-table reducible to some P-selective sets, then C=P, which resolves a question that has been left open for a long time.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"27 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":"133782586","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}
引用次数: 80
Random strings make hard instances 随机字符串产生硬实例
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315802
H. Buhrman, P. Orponen
{"title":"Random strings make hard instances","authors":"H. Buhrman, P. Orponen","doi":"10.1109/SCT.1994.315802","DOIUrl":"https://doi.org/10.1109/SCT.1994.315802","url":null,"abstract":"We establish the truth of the \"instance complexity conjecture\" in the case of DEXT-complete sets w.r.t. polynomial time computations, and r.e. complete sets w.r.t. recursive computations. Specifically, we obtain for every DEXT-complete set A an exponentially dense subset C such that for every nondecreasing polynomial t(n)=/spl omega/(n log n), ic/sup t/(x:A)/spl ges/K/sup t/(x)-c holds for some constant c and all x/spl isin/C, where ic/sup t/ and K/sup t/ are the t-bounded instance complexity and Kolmogorov complexity measures, respectively. For r.e. complete sets A we obtain an infinite set C/spl sube/A~ such that ic/sup /spl infin(x:A)/spl ges/K/sup /spl infin(x)-c holds for some constant c and all x/spl isin/C. The proofs are based on the observation that Kolmogorov random strings are individually hard to recognize by bounded computations.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"54 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":"128405034","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}
引用次数: 17
On ultrafilters and NP 关于超滤和NP
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315813
S. Ben-David, M. Karchmer, E. Kushilevitz
{"title":"On ultrafilters and NP","authors":"S. Ben-David, M. Karchmer, E. Kushilevitz","doi":"10.1109/SCT.1994.315813","DOIUrl":"https://doi.org/10.1109/SCT.1994.315813","url":null,"abstract":"The fusion method (A. Wigderson, 1993) is developed by exploring its similarities with the ultraproduct construction in model theory. We use this analogy to re-prove a result of M. Sipser (1984) regarding countable circuits, in a simpler way. In the finite case this analogy allows us to give a new characterization of co-NP in terms of the CLIQUE function. This gives a natural interpretation to the NP-completeness of the CLIQUE function.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"62 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":"125832191","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}
引用次数: 2
On the query complexity of clique size and maximum satisfiability 关于团大小的查询复杂度和最大可满足性
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI: 10.1109/SCT.1994.315820
Richard Chang
{"title":"On the query complexity of clique size and maximum satisfiability","authors":"Richard Chang","doi":"10.1109/SCT.1994.315820","DOIUrl":"https://doi.org/10.1109/SCT.1994.315820","url":null,"abstract":"The paper explores the bounded query complexity of approximating the size of the maximum clique in a graph (clique size) and the number of simultaneously satisfiable clauses in a 3CNF formula (MAX3SAT). The results show that for certain approximation factors, approximating clique size and MAX3SAT are complete for corresponding bounded query classes under metric reductions. The completeness result is important because it shows that queries and approximation are interchangeable: NP queries can be used to solve NP-approximation problems and solutions to NP-approximation problems answer queries to NP oracles. Completeness also shows the existence of approximation preserving reductions from many NP-approximation problems to approximating clique size and MAX3SAT (e.g., from approximating chromatic number to approximating clique size). Finally, since query complexity is a quantitative complexity measure, these results also provide a framework for comparing the complexities of approximating clique size and approximating MAX3SAT.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"110 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":"122679707","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}
引用次数: 13
首页 上一页 下一页 尾页
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学术官方微信