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

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference最新文献

筛选
英文 中文
Bounded queries in recursion theory: a survey 递归理论中的有界查询:综述
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI: 10.1109/SCT.1991.160245
W. Gasarch
{"title":"Bounded queries in recursion theory: a survey","authors":"W. Gasarch","doi":"10.1109/SCT.1991.160245","DOIUrl":"https://doi.org/10.1109/SCT.1991.160245","url":null,"abstract":"The author surveys much of the work that has been done on the following two questions: (1) What functions can one compute with m queries to A? and (2) Are there functions that can be computed with m queries to A that cannot be computed with m-1 queries to A? To any set X? The framework is recursion-theoretic; the computations have no time or space bound.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127169001","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}
引用次数: 30
One-way functions, hard on average problems, and statistical zero-knowledge proofs 单向函数，平均问题，统计零知识证明
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI: 10.1109/SCT.1991.160253
R. Ostrovsky
{"title":"One-way functions, hard on average problems, and statistical zero-knowledge proofs","authors":"R. Ostrovsky","doi":"10.1109/SCT.1991.160253","DOIUrl":"https://doi.org/10.1109/SCT.1991.160253","url":null,"abstract":"The author studies connections among one-way functions, hard on the average problems, and statistical zero-knowledge proofs. In particular, he shows how these three notions are related and how the third notion can be better characterized, assuming the first one.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123101703","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}
引用次数: 78
Approximation and small depth Frege proofs 近似和小深度弗雷格证明
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI: 10.1109/SCT.1991.160281
S. Bellantoni, T. Pitassi, A. Urquhart
{"title":"Approximation and small depth Frege proofs","authors":"S. Bellantoni, T. Pitassi, A. Urquhart","doi":"10.1109/SCT.1991.160281","DOIUrl":"https://doi.org/10.1109/SCT.1991.160281","url":null,"abstract":"M. Ajtai (1988) recently proved that if, for some fixed d, every formula in a Frege proof of the propositional pigeonhole principle PHP/sub n/ has depth at most d, then the proof size is not less than any polynomial in n. By introducing the notion of an approximate proof the authors demonstrate how to eliminate the nonstandard model theory, including the nonconstructive use of the compactness theorem, from Ajtai's lower bound. An approximate proof is one in which each inference is sound on a subset of the possible truth assignments-possibly a different subset for each inference. The authors also improve the lower bound, giving a specific superpolynomial function bounding the proof size from below.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128352958","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}
引用次数: 74
A complexity theory for feasible closure properties 可行闭包性质的复杂性理论
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI: 10.1109/SCT.1991.160240
M. Ogiwara, L. Hemachandra
{"title":"A complexity theory for feasible closure properties","authors":"M. Ogiwara, L. Hemachandra","doi":"10.1109/SCT.1991.160240","DOIUrl":"https://doi.org/10.1109/SCT.1991.160240","url":null,"abstract":"The authors propose and develop a complexity theory of feasible closure properties. For each of the classes Hash P, SpanP, OptP, and MidP, they establish complete characterizations-in terms of complexity class collapses-of the conditions under which the class has all feasible closure properties. In particular, Hash P is P-closed if and only if PP=UP; SpanP is P-closed if and only if R-MidP is P-closed if and only if P/sup PP/=NP; and OptP is P-closed if and only if NP=co-NP. Furthermore, for each of these classes, the authors show natural operations-such as subtraction and division-to be hard closure properties, in the sense that if a class is closed under one of these, then it has all feasible closure properties. They also study potentially intermediate closure properties for Hash P. These properties-maximum, minimum, median, and decrement-seem neither to be possessed by Hash P nor to be Hash P-hard.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129597237","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}
引用次数: 41
Superlinear lower bounds for bounded-width branching programs 有界宽度分支规划的超线性下界
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI: 10.1109/SCT.1991.160274
D. M. Barrington, Howard Straubing
{"title":"Superlinear lower bounds for bounded-width branching programs","authors":"D. M. Barrington, Howard Straubing","doi":"10.1109/SCT.1991.160274","DOIUrl":"https://doi.org/10.1109/SCT.1991.160274","url":null,"abstract":"The authors use algebraic techniques to obtain superlinear lower bounds on the size of bounded-width branching programs to solve a number of problems. In particular, they show that any bounded-width branching program computing a nonconstant threshold function has length Omega (n log log n), improving on the previous lower bounds known to apply to all such threshold functions. They also show that any program over a finite solvable monoid computing products in a nonsolvable group has length Omega (n log log n). This result is a step toward proving the conjecture that the circuit complexity class ACC/sup 0/ is properly contained in NC/sup 1/.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123163873","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
PSPACE is provable by two provers in one round PSPACE是由两个证明者在一轮中证明的
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI: 10.1109/SCT.1991.160250
Jin-Yi Cai, A. Condon, R. Lipton
{"title":"PSPACE is provable by two provers in one round","authors":"Jin-Yi Cai, A. Condon, R. Lipton","doi":"10.1109/SCT.1991.160250","DOIUrl":"https://doi.org/10.1109/SCT.1991.160250","url":null,"abstract":"It is shown that every language in PSPACE, or equivalently every language accepted by an unbounded round interactive proof system, has a one-round, two-prover interactive proof with exponentially small error probability. To obtain this result, the correctness of a simple but powerful method for parallelizing two-prover interactive proofs to reduce their error is proved.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"37 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120853440","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}
引用次数: 43
On reductions of NP sets to sparse sets 关于NP集到稀疏集的约简
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI: 10.1109/SCT.1991.160246
S. Homer, L. Longpré
{"title":"On reductions of NP sets to sparse sets","authors":"S. Homer, L. Longpré","doi":"10.1109/SCT.1991.160246","DOIUrl":"https://doi.org/10.1109/SCT.1991.160246","url":null,"abstract":"M. Ogiwara and O. Watanabe (1990) showed that if SAT is bounded truth-table reducible to a sparse set, then P=NP. In the present work, the authors simplify their proof, strengthen the result, and use it to obtain several new results. Among the new results are the following: applications of the main theorem to log-truth-table and log-Turing reductions of NP sets to sparse sets; generalizations of the main theorem which yield results similar to the main result at arbitrary levels of the polynomial hierarchy; and the construction of an oracle relative to which P not=NP but there are NP-complete sets which are f(n)-tt-reducible to a tally set, for any f(n) in Omega (log n).<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116098715","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}
引用次数: 55
Degree complexity of Boolean functions and its applications to relativized separations 布尔函数的复杂度及其在相对分离中的应用
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI: 10.1109/SCT.1991.160282
J. Tarui
{"title":"Degree complexity of Boolean functions and its applications to relativized separations","authors":"J. Tarui","doi":"10.1109/SCT.1991.160282","DOIUrl":"https://doi.org/10.1109/SCT.1991.160282","url":null,"abstract":"It is shown that a simple function in AC/sup 0/, OR of square root n disjoint ANDs, cannot be computed by decision trees of depth log/sup O(1)/n where each node asks whether or not p(x/sub 1/, . . .,x/sub n/)=0 for some polynomial p of degree log/sup O(1)/n. This is in contrast to recent results that every function in AC/sup 0/ can be computed probabilistically by just one such query and can be deterministically computed by such decision trees if each node asks whether or not p(x/sub 1/, . . .,x/sub n/)>0. The proofs are based on simple algebraic arguments that also provide alternative proofs for some known results.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128570536","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}
引用次数: 19
Errata for circuit size relative to pseudorandom oracles 相对于伪随机预言机的电路大小的勘误表
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI: 10.1109/SCT.1991.160284
J. H. Lutz, William J. Schmidt
{"title":"Errata for circuit size relative to pseudorandom oracles","authors":"J. H. Lutz, William J. Schmidt","doi":"10.1109/SCT.1991.160284","DOIUrl":"https://doi.org/10.1109/SCT.1991.160284","url":null,"abstract":"In the above-titled paper (see Proc. Fifth Structure in Complexity Theory Conf., 1990, p.268-86) by the present authors it was claimed that two specified separations hold relative to every pspace-random oracle A, and relative to almost every oracle A in ESPACE. It is noted that the proofs given were not correct and that corrected proofs are being published elsewhere. Some further discussion regarding these proofs is presented.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134172636","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
Combinatorics and Kolmogorov complexity 组合学和Kolmogorov复杂度
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI: 10.1109/SCT.1991.160256
Ming Li, P. Vitányi
{"title":"Combinatorics and Kolmogorov complexity","authors":"Ming Li, P. Vitányi","doi":"10.1109/SCT.1991.160256","DOIUrl":"https://doi.org/10.1109/SCT.1991.160256","url":null,"abstract":"The authors investigate combinatorial properties of finite sequences with high Kolmogorov complexity. They also demonstrate the utility of a Kolmogorov complexity method in combinatorial theory by several examples (such as the coin-weighing problem).<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123097451","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}
引用次数: 18
首页 上一页 下一页 尾页
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学术官方微信