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

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference最新文献

筛选
英文 中文
On span programs 关于span程序
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336536
M. Karchmer, A. Wigderson
{"title":"On span programs","authors":"M. Karchmer, A. Wigderson","doi":"10.1109/SCT.1993.336536","DOIUrl":"https://doi.org/10.1109/SCT.1993.336536","url":null,"abstract":"A linear algebraic model of computation the span program, is introduced, and several upper and lower bounds on it are proved. These results yield applications in complexity and cryptography. The proof of the main connection, between span programs and counting branching programs, uses a variant of Razborov's general approximation method.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114347952","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}
引用次数: 521
SPARSE reduces conjunctively to TALLY 稀疏化约为TALLY
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336525
H. Buhrman, E. Hemaspaandra, L. Longpré
{"title":"SPARSE reduces conjunctively to TALLY","authors":"H. Buhrman, E. Hemaspaandra, L. Longpré","doi":"10.1109/SCT.1993.336525","DOIUrl":"https://doi.org/10.1109/SCT.1993.336525","url":null,"abstract":"Polynomials over finite fields are used to conjunctively reduce any sparse set to a tally set. This leads to the derivation of new results and to new simple proofs of known results about various classes that lie between P and P/poly.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122568951","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}
引用次数: 36
On closure properties of Hash P in the context of PF (omicron) Hash P 关于PF (omicron)哈希P的闭包性质
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336532
M. Ogihara, T. Thierauf, Seinosuke Toda, O. Watanabe
{"title":"On closure properties of Hash P in the context of PF (omicron) Hash P","authors":"M. Ogihara, T. Thierauf, Seinosuke Toda, O. Watanabe","doi":"10.1109/SCT.1993.336532","DOIUrl":"https://doi.org/10.1109/SCT.1993.336532","url":null,"abstract":"It is shown that while absolute answers to open questions about relationships between counting classes seem hard to get, it is still possible to obtain relative answers that help us to develop intuition about or understanding of these relationships. In particular, a structural approach to extending such understanding is proposed.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130412536","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
P-selective sets, and reducing search to decision vs. self-reducibility p选择集，以及约简搜索到决策与自约化
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336541
E. Hemaspaandra, A. Naik, M. Ogihara, A. Selman
{"title":"P-selective sets, and reducing search to decision vs. self-reducibility","authors":"E. Hemaspaandra, A. Naik, M. Ogihara, A. Selman","doi":"10.1109/SCT.1993.336541","DOIUrl":"https://doi.org/10.1109/SCT.1993.336541","url":null,"abstract":"Several results that distinguish self-reducibility of a language L with the question of whether search reduces to decision for L are obtained. It is proved that if NE intersection co-NE not=E, then there exists a set L in NP-P such that search reduces to decision for L, search does not nonadaptively reduce to decision for L, and L is not self-reducible. Results that distinguish adaptively randomly self-reducible sets from nonadaptively randomly self-reducible sets, results concerning tradeoffs in multipower interactive proof systems, and results that distinguish checkable languages from those that are nonadaptively checkable are obtained. Many of the results depend on new techniques for constructing P-selective sets.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128404943","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}
引用次数: 68
Complexity and structure in formal language theory 形式语言理论中的复杂性和结构
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336523
Klaus-Jörn Lange
{"title":"Complexity and structure in formal language theory","authors":"Klaus-Jörn Lange","doi":"10.1109/SCT.1993.336523","DOIUrl":"https://doi.org/10.1109/SCT.1993.336523","url":null,"abstract":"Some connections between formal languages and complexity are reviewed. Families of formal languages are treated with complexity theoretical methods. In particular, the concept of unambiguity, common to both areas, is treated in detail. Some new results on deterministic families of formal languages and on complexities of operations on formal languages are indicated.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124660703","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
The polynomial method in circuit complexity 电路复杂度的多项式方法
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336538
R. Beigel
{"title":"The polynomial method in circuit complexity","authors":"R. Beigel","doi":"10.1109/SCT.1993.336538","DOIUrl":"https://doi.org/10.1109/SCT.1993.336538","url":null,"abstract":"The basic techniques for using polynomials in complexity theory are examined, emphasizing intuition at the expense of formality. The focus is on the connections to constant-depth circuits, at the expense of polynomial-time Turing machines. The closure properties, upper bounds, and lower bounds obtained by this approach are surveyed.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116900823","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}
引用次数: 186
Taking it to the limit: on infinite variants of NP-complete problems 求极限:np完全问题的无穷变体
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336518
T. Hirst, D. Harel
{"title":"Taking it to the limit: on infinite variants of NP-complete problems","authors":"T. Hirst, D. Harel","doi":"10.1109/SCT.1993.336518","DOIUrl":"https://doi.org/10.1109/SCT.1993.336518","url":null,"abstract":"Infinite, recursive versions of NP optimization problems are defined. For example, MAX CLIQUE becomes the question of whether a recursive graph contains an infinite clique. The work was motivated by trying to understand what makes some NP problems highly undecidable in the infinite case, while others remain on low levels of the arithmetical hierarchy. Two results are proved; one enables using knowledge about the infinite case to yield implications to the finite case, and the other enables implications in the other direction. Taken together, the two results provide a method for proving (finitary) problems to be outside the syntactic class MAX NP, hence outside MAX SNP too. The technique is illustrated with many examples.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124467415","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}
引用次数: 26
On monadic NP vs. monadic co-NP 关于一元NP和一元共NP
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336544
Ronald Fagin, L. Stockmeyer, Moshe Y. Vardi
{"title":"On monadic NP vs. monadic co-NP","authors":"Ronald Fagin, L. Stockmeyer, Moshe Y. Vardi","doi":"10.1109/SCT.1993.336544","DOIUrl":"https://doi.org/10.1109/SCT.1993.336544","url":null,"abstract":"It is proved that connectivity of finite graphs is not in monadic NP, even in the presence of arbitrary built-in relations of moderate degree (that is, degree (log n) /sup o(1)/). This results in a strong separation between monadic NP and monadic co-NP. The proof uses a combination of three techniques: (1) a technique of W. Hanf (1965) for showing that two (infinite) structures agree on all first-order sentences, under certain conditions; (2) a recent approach to second-order Ehrenfeucht-Fraisse games by M. Ajtai and R. Fagin (1990); and (3) playing Ehrenfeucht-Fraisse games over random structures. Regarding (1), a version of Hanf's result that is better suited for use as a tool in inexpressibility proofs for classes of finite structures is given. The power of these techniques is further demonstrated by using the first two techniques to give a very simple proof of the separation of monadic NP from monadic co-NP without the presence of built-in relations.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129539944","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}
引用次数: 181
Polynomial isomorphism of 1-L-complete sets 1- l完备集的多项式同构
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336539
Manindra Agrawal, Somenath Biswas
{"title":"Polynomial isomorphism of 1-L-complete sets","authors":"Manindra Agrawal, Somenath Biswas","doi":"10.1109/SCT.1993.336539","DOIUrl":"https://doi.org/10.1109/SCT.1993.336539","url":null,"abstract":"Let C be any complexity class closed under log-lin reductions. It is shown that all complete sets for C under 1-L reductions are polynomial time isomorphic to one other. It is indicated how to generalize the result to reductions computed by finite-crossing machines.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121770902","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
The complexity of selecting maximal solutions 选择极大解的复杂性
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336516
Zhi-Zhong Chen, Seinosuke Toda
{"title":"The complexity of selecting maximal solutions","authors":"Zhi-Zhong Chen, Seinosuke Toda","doi":"10.1109/SCT.1993.336516","DOIUrl":"https://doi.org/10.1109/SCT.1993.336516","url":null,"abstract":"Specific maximization problems, such as the maximal independent set problem and the minimal unsatisfiability problem, are studied in a general framework. The goal is to show what factors make maximization problems hard or easy to solve and how the factors influence the complexity of solving the problems. Maximization problems are divided into several classes, and both upper and lower bounds for them are proved. An important consequence of the results is that finding an X-minimal satisfying truth assignment to a given CNF Boolean formula is complete for NPMV/OptP(O(log n)), solving an open question of C.H. Papadimitriou (1991).<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126786932","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}
引用次数: 75
首页 上一页 下一页 尾页
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学术官方微信