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

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference最新文献

筛选
英文 中文
The instance complexity conjecture 实例复杂度猜想
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514733
M. Kummer
{"title":"The instance complexity conjecture","authors":"M. Kummer","doi":"10.1109/SCT.1995.514733","DOIUrl":"https://doi.org/10.1109/SCT.1995.514733","url":null,"abstract":"This paper is concerned with instance complexity introduced by Ko, Orponen, Schoning, and Watanabe (1986) as a measure of the complexity of individual instances of a decision problem. They conjectured that for every nonrecursive r.e. set the instance complexity is infinitely often at least as high as the Kolmogorov complexity. We refute this conjecture by constructing a nonrecursive r.e. set with instance complexity logarithmic in the Kolmogorov complexity. This bound is optimal up to a constant. In the other extreme, we show that the conjecture can indeed be established for many classes of complete sets. In addition we consider Kolmogorov complexity of initial segments of r.e. sets and show that the well-known upper bound 2 log n is optimal.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125394064","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}
引用次数: 4
DSPACE(n)=?NSPACE(n): a degree theoretic characterization DSPACE(n)=?NSPACE(n):度理论表征
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514869
Manindra Agrawal
{"title":"DSPACE(n)=?NSPACE(n): a degree theoretic characterization","authors":"Manindra Agrawal","doi":"10.1109/SCT.1995.514869","DOIUrl":"https://doi.org/10.1109/SCT.1995.514869","url":null,"abstract":"It is shown that the following are equivalent: 1. DSPACE(n)=NSPACE(n). 2. There is a /spl les//sub m//sup 1-NL/-degree that coincides with a /spl les//sub m//sup 1-L/ degree. 3. For every class C closed under logspace reductions the /spl les//sub m//sup 1-NL/-complete degree of C coincides with the /spl les//sub m//sup 1-L/-complete degree of C.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122163185","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
A small span theorem for P/Poly-Turing reductions P/聚图灵约简的一个小张成定理
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514870
J. H. Lutz
{"title":"A small span theorem for P/Poly-Turing reductions","authors":"J. H. Lutz","doi":"10.1109/SCT.1995.514870","DOIUrl":"https://doi.org/10.1109/SCT.1995.514870","url":null,"abstract":"This paper investigates the structure of ESPACE under nonuniform Turing reductions that are computed by polynomial-size circuits (P/Poly-Turing reductions). A small span theorem is proven for such reductions. This result says that every language A in ESPACE satisfies at least one of the following two conditions. (i) The lower P/Poly-Turing span of A (consisting of all languages that are P/Poly-Turing reducible to A) has measure 0 in PSPACE. (ii) The upper P/Poly-Turing span of A (consisting of all languages to which A is P/Poly-Turing reducible) has pspace-measure 0, hence measure 0 in ESPACE. The small span theorem implies that every P/Poly-Turing degree has measure 0 in ESPACE, and that there exist languages that are weakly P-many-one complete, but not P/Poly-Turing complete for ESPACE. The method of proof is a significant departure from earlier proofs of small span theorems for weaker types of reductions. P/Poly-Turing span of A (consisting of all languages to which A is P/Poly-Turing reducible) has pspace-measure 0, hence measure 0 in ESPACE. The small span theorem implies that every P/Poly-Turing degree has measure 0 in ESPACE, and that there exist languages that are weakly P-many-one complete, but not P/Poly-Turing complete for ESPACE. The method of proof is a significant departure from earlier proofs of small span theorems for weaker types of reductions.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121413981","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}
引用次数: 10
Reductions of self-reducible sets to depth-1 weighted threshold circuit classes, and sparse sets 自约集约简为深度1加权阈值电路类和稀疏集
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514865
Manindra Agrawal, V. Arvind
{"title":"Reductions of self-reducible sets to depth-1 weighted threshold circuit classes, and sparse sets","authors":"Manindra Agrawal, V. Arvind","doi":"10.1109/SCT.1995.514865","DOIUrl":"https://doi.org/10.1109/SCT.1995.514865","url":null,"abstract":"Let LT/sub 1/ denote the class of languages accepted by nonuniform families of polynomial size depth-1 circuits with a linear weighted threshold gate at the root. We show that disjunctive self-reducible bd-cylinders that many-one reduce to LT/sub 1/ are in P. It follows that for C/spl isin.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133036270","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}
引用次数: 3
Restricted information from nonadaptive queries to NP 限制信息从非自适应查询到NP
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514859
Yenjo Han, T. Thierauf
{"title":"Restricted information from nonadaptive queries to NP","authors":"Yenjo Han, T. Thierauf","doi":"10.1109/SCT.1995.514859","DOIUrl":"https://doi.org/10.1109/SCT.1995.514859","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.0,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134491814","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}
引用次数: 0
Optimizing TRIEs for ordered pattern matching is /spl Pi//sub 2//sup P/-complete 对有序模式匹配的优化try是/spl Pi// sub2 //sup P/-complete
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514862
Chih-Long Lin
{"title":"Optimizing TRIEs for ordered pattern matching is /spl Pi//sub 2//sup P/-complete","authors":"Chih-Long Lin","doi":"10.1109/SCT.1995.514862","DOIUrl":"https://doi.org/10.1109/SCT.1995.514862","url":null,"abstract":"We consider the complexity of constructing a data structure, called TRIEs, with the minimum operational cost for the ordered pattern matching problem, a problem abstracting the essence of executing Prolog problems; a TRIE with minimal cost corresponds to a program with the minimum worst case operational cost. Based on the recent non-approximability results developed by Arora et al. (1992) and Condon et al. (1993), we show that to approximate the optimum cost of this problem to within some constant ratio is /spl Pi//sub 2//sup P/-hard. The result implies that the problem of Prolog program optimization is probably as hard.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115268999","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}
引用次数: 4
On the power of number-theoretic operations with respect to counting 论数论运算与计数的关系
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514868
U. Hertrampf, H. Vollmer, K. Wagner
{"title":"On the power of number-theoretic operations with respect to counting","authors":"U. Hertrampf, H. Vollmer, K. Wagner","doi":"10.1109/SCT.1995.514868","DOIUrl":"https://doi.org/10.1109/SCT.1995.514868","url":null,"abstract":"We investigate function classes /sub f/ which are defined as the closure of P under the operation f and a set of known closure properties of P, e.g. summation over an exponential range. First, we examine operations f under which P is closed (i.e., /sub f/=P) in every relativization. We obtain the following complete characterization of these operations: P is closed under f in every relativization if and only if f is a finite sum of binomial coefficients over constants. Second, we characterize operations f with respect to their power in the counting context in the unrelativized case. For closure properties f of P, we have /sub f/= P. The other end of the range is marked by operations f for which /sub f/ corresponds to the counting hierarchy. We call these operations counting hard and give general criteria for hardness. For many operations f we show that /sub f/ corresponds to some subclass C of the counting hierarchy. This will then imply that P is closed under f if and only if UP=C; and on the other hand f is counting hard if and only if C contains the counting hierarchy.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117224917","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}
引用次数: 45
Fault tolerant circuits and probabilistically checkable proofs 容错电路和概率检验证明
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514728
A. Gál, M. Szegedy
{"title":"Fault tolerant circuits and probabilistically checkable proofs","authors":"A. Gál, M. Szegedy","doi":"10.1109/SCT.1995.514728","DOIUrl":"https://doi.org/10.1109/SCT.1995.514728","url":null,"abstract":"We introduce a new model of fault tolerance for Boolean circuits. We consider synchronized circuits and we allow an adversary to choose a small constant fraction of the gates at each level of the circuit to be faulty. We require that even in the presence of such faults the circuit compute a \"loose version\" of the given function. We show that every symmetric function has a small (size O(n), depth O(log n)) fault tolerant circuit in this model. We also show a perhaps unexpected relation between our model and probabilistically checkable proofs.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122783130","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}
引用次数: 16
Intractability of read-once resolution 一次读取解析的难治性
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1995-06-19 DOI: 10.1109/SCT.1995.514725
K. Iwama, Eiji Miyano
{"title":"Intractability of read-once resolution","authors":"K. Iwama, Eiji Miyano","doi":"10.1109/SCT.1995.514725","DOIUrl":"https://doi.org/10.1109/SCT.1995.514725","url":null,"abstract":"Read-once resolution (ROR) is a resolution proof system in which the rule (A+x)(B+.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126171389","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 low sets [complexity classes] 论低集[复杂度类]的结构
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference Pub Date : 1900-01-01 DOI: 10.1109/SCT.1995.514863
J. Kobler
{"title":"On the structure of low sets [complexity classes]","authors":"J. Kobler","doi":"10.1109/SCT.1995.514863","DOIUrl":"https://doi.org/10.1109/SCT.1995.514863","url":null,"abstract":"Over a decade ago, V. Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexity classes according to their lowness properties. In this paper we highlight some of the more recent advances on selected topics in the area. Among the lowness properties we consider are polynomial-size circuit complexity, membership comparability, approximability, selectivity, and cheatability. Furthermore, we review some of the recent results concerning lowness for counting classes.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123161122","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}
引用次数: 28
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信