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

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

筛选
英文 中文
Some structural complexity aspects of neural computation 神经计算的结构复杂性
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336521
J. Balcázar, Ricard Gavaldà, H. Siegelmann, Eduardo Sontag
{"title":"Some structural complexity aspects of neural computation","authors":"J. Balcázar, Ricard Gavaldà, H. Siegelmann, Eduardo Sontag","doi":"10.1109/SCT.1993.336521","DOIUrl":"https://doi.org/10.1109/SCT.1993.336521","url":null,"abstract":"Recent work by H.T. Siegelmann and E.D. Sontag (1992) has demonstrated that polynomial time on linear saturated recurrent neural networks equals polynomial time on standard computational models: Turing machines if the weights of the net are rationals, and nonuniform circuits if the weights are real. Here, further connections between the languages recognized by such neural nets and other complexity classes are developed. Connections to space-bounded classes, simulation of parallel computational models such as Vector Machines, and a discussion of the characterizations of various nonuniform classes in terms of Kolmogorov complexity are presented.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"27 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":"126540392","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
P-selective self-reducibles sets: a new characterization of P P-选择性自约集:P的一个新表征
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336542
H. Buhrman, L. Torenvliet
{"title":"P-selective self-reducibles sets: a new characterization of P","authors":"H. Buhrman, L. Torenvliet","doi":"10.1109/SCT.1993.336542","DOIUrl":"https://doi.org/10.1109/SCT.1993.336542","url":null,"abstract":"It is shown that any p-selective and self-reducible sets is in P. As the converse is also true, the authors obtain a new characterization of the class P. A generalization and several consequences of this theorem are discussed. Among other consequences, it is shown that under reasonable assumptions autoreducibility and self-reducibility differ on NP, and there are non-p-T-mitotic sets in NP.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"29 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":"133093895","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}
引用次数: 48
Pointers versus arithmetic in PRAMs pram中的指针与算术
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336522
Patrick W. Dymond, Faith Ellen, N. Nishimura, P. Ragde, W. L. Ruzzo
{"title":"Pointers versus arithmetic in PRAMs","authors":"Patrick W. Dymond, Faith Ellen, N. Nishimura, P. Ragde, W. L. Ruzzo","doi":"10.1109/SCT.1993.336522","DOIUrl":"https://doi.org/10.1109/SCT.1993.336522","url":null,"abstract":"A parallel pointer machine, (PPM) is a parallel model having pointers as its principal data type. PPMs have been characterized as PRAMs obeying two restrictions: restricted arithmetic capabilities and the CROW (concurrent read, owner write) memory access restriction. Results concerning the relative power of PPMs (and other arithmetically restricted PRAMs) versus CROW PRAMs having ordinary arithmetic capabilities are presented. First, lower bounds separating PPMs from CROW PRAMs are proved. Second, it is shown that this lower bound is tight. As a corollary, sharply improved PPM algorithms are obtained for a variety of problems, including deterministic context-free language recognition.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"68 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":"129989933","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
On proving lower bounds for circuit size 关于证明电路尺寸的下界
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336535
M. Karchmer
{"title":"On proving lower bounds for circuit size","authors":"M. Karchmer","doi":"10.1109/SCT.1993.336535","DOIUrl":"https://doi.org/10.1109/SCT.1993.336535","url":null,"abstract":"A.A. Razborov's (1989) generalized approximation method, which has the potential of giving tight lower bounds for circuit size, is considered. The method is described in a more intuitive fashion, and its analogy with the ultraproduct construction in model theory is made explicit. The method is extended so that it can be used to lower bound nondeterministic circuit size. Using the proposed framework, a new proof for the exponential monotone size lower bound for the clique function is presented.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"12 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":"122456220","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}
引用次数: 34
On completeness under random reductions 关于随机约简下的完备性
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336529
Suresh Chari, P. Rohatgi
{"title":"On completeness under random reductions","authors":"Suresh Chari, P. Rohatgi","doi":"10.1109/SCT.1993.336529","DOIUrl":"https://doi.org/10.1109/SCT.1993.336529","url":null,"abstract":"The authors study the notion of completeness under random reductions and explore how that depends on the type and success probability of the reduction. They obtain absolute separations between completeness notions under various random reductions and between random reductions and deterministic reductions. These separations are obtained in appropriately high complexity classes where these questions do not have contradictory relativizations. The results show that the notion of completeness under random reductions is sensitive to very small changes in success probability.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"45 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":"132326299","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
Lower bounds on representing Boolean functions as polynomials in Z/sub m/ 表示布尔函数为Z/下标m/多项式的下界
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336537
Shi-Chun Tsai
{"title":"Lower bounds on representing Boolean functions as polynomials in Z/sub m/","authors":"Shi-Chun Tsai","doi":"10.1109/SCT.1993.336537","DOIUrl":"https://doi.org/10.1109/SCT.1993.336537","url":null,"abstract":"The MOD/sub m/-degree of Boolean function F is defined to be the smallest degree of any polynomial P, over the ring of integers modulo m, such that for all 0-1 assignments x, F(x)=0 iff P(x)=0. By exploring the periodic property of the binomial coefficients module m, two new lower bounds on the MOD/sub m/-degree of the MOD/sub l/ and not-MOD/sub m/ functions are proved, where m is any composite integer and l has a prime factor not dividing m. Both bounds improve from n/sup Omega (1)/ in D.A.M. Barrington et al. (1992) to Omega (n). A lower bound, n/2, for the majority function and a lower bound, square root n, for the MidBit function are also proved.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"209 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":"121718800","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}
引用次数: 14
NP-complete problems have a version that's hard to approximate np完全问题有一个难以近似的版本
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336517
David Zuckerman
{"title":"NP-complete problems have a version that's hard to approximate","authors":"David Zuckerman","doi":"10.1109/SCT.1993.336517","DOIUrl":"https://doi.org/10.1109/SCT.1993.336517","url":null,"abstract":"It is proved that all of R.M. Karp's (1972) 21 original NP-complete problems have a version that is hard to approximate. These versions are obtained from the original problems by adding essentially the same, simple constraint. It is further shown that these problems are absurdly hard to approximate. In fact, one cannot even approximate log/sup (k)/ of the magnitude of these problems to within a constant factor, where log/sup (k)/ denotes the iterated logarithm, unless NP is recognized by slightly superpolynomial randomized machines. It is also shown that it is even harder to approximate two counting problems: counting the number of satisfying assignments to a monotone 2-SAT formula and computing the permanent of -1, 0, 1 matrices.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"325 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":"115844759","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}
引用次数: 97
On the power of polynomial time bit-reductions 基于多项式时间位约简的幂
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI: 10.1109/SCT.1993.336526
U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K. Wagner
{"title":"On the power of polynomial time bit-reductions","authors":"U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K. Wagner","doi":"10.1109/SCT.1993.336526","DOIUrl":"https://doi.org/10.1109/SCT.1993.336526","url":null,"abstract":"For a nondeterministic polynomial-time Turing machine M and an input string x, the leaf string of M on x is the 0-1-sequence of leaf-values (0 approximately reject, 1 approximately accept) of the computation tree of M with input x. The set A is said to be bit-reducible to B if there exists and M as above such that every input x is in A if and only if the leaf string of M on x is in B. A class C is definable via leaf language B, if C is the class of all languages that are bit-reducible to B. The question of how complex a leaf language must be in order to characterize some given class C is investigated. This question leads to the examination of the closure of different language classes under bit-reducibility. The question is settled for subclasses of regular languages, context free languages, and a number of time and space bounded classes, resulting in a number of surprising characterizations for PSPACE.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"113 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":"126739800","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}
引用次数: 100
首页 上一页
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学术官方微信