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

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

筛选
英文 中文
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
Super-logarithmic depth lower bounds via direct sum in communication complexity 通信复杂度直接求和的超对数深度下界
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI: 10.1109/SCT.1991.160273
M. Karchmer, R. Raz, A. Wigderson
{"title":"Super-logarithmic depth lower bounds via direct sum in communication complexity","authors":"M. Karchmer, R. Raz, A. Wigderson","doi":"10.1109/SCT.1991.160273","DOIUrl":"https://doi.org/10.1109/SCT.1991.160273","url":null,"abstract":"The question of whether it is easier to solve two communication problems together rather than separately is related to the complexity of the composition of Boolean functions. Based on this relationship, an approach to separating NC/sup 1 /from P is outlined. Furthermore, it is shown that the approach provides a new proof of the separation of monotone NC/sup 1/ from monotone P.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"86 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":"117270343","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}
引用次数: 11
Relating equivalence and reducibility to sparse sets 稀疏集的等价性和可约性
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI: 10.1109/SCT.1991.160264
E. Allender, L. Hemaspaandra, M. Ogihara, O. Watanabe
{"title":"Relating equivalence and reducibility to sparse sets","authors":"E. Allender, L. Hemaspaandra, M. Ogihara, O. Watanabe","doi":"10.1109/SCT.1991.160264","DOIUrl":"https://doi.org/10.1109/SCT.1991.160264","url":null,"abstract":"For various polynomial-time reducibilities r, the authors ask whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distinguishing equivalence and reducibility to sparse sets, for many-one or 1-truth-table reductions, would imply that P not=NP, the authors show that for k-truth-table reductions, k>or=2, equivalence and reducibility to sparse sets provably differ. Though R. Gavalda and D. Watanabe have shown that, for any polynomial-time computable unbounded function f(.), some sets f(n)-truth-table reducible to sparse sets are not even Turing equivalent to sparse sets, the authors show that extending their result to the 2-truth-table case would provide a proof that P not=NP. Additionally, the authors study the relative power of different notions of reducibility and show that disjunctive and conjunctive truth-table reductions to sparse sets are surprisingly powerful, refuting a conjecture of K. Ko (1989).<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"193 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":"116447085","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
Approximation properties of NP minimization classes NP最小化类的近似性质
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-04-01 DOI: 10.1109/SCT.1991.160280
Phokion G. Kolaitis, Madhukar N. Thakur
{"title":"Approximation properties of NP minimization classes","authors":"Phokion G. Kolaitis, Madhukar N. Thakur","doi":"10.1109/SCT.1991.160280","DOIUrl":"https://doi.org/10.1109/SCT.1991.160280","url":null,"abstract":"The authors introduce a novel approach to the logical definability of NP optimization problems by focusing on the expressibility of feasible solutions. They show that in this framework first-order sentences capture exactly all polynomially bounded optimization problems. They also show that, assuming P not=NP, it is an undecidable problem to determine whether a given first-order sentence defines an approximable optimization problem. They then isolate a syntactically defined class of NP minimization problems that contains the min set cover problem and has the property that every problem in it has a logarithmic approximation algorithm. They conclude by giving a machine-independent characterization of the NP=co-NP problem in terms of logical expressibility of the max clique problem.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"381 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116058893","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}
引用次数: 101
The complexity of malign ensembles 恶性组合的复杂性
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1990-09-01 DOI: 10.1109/SCT.1991.160257
Peter Bro Miltersen
{"title":"The complexity of malign ensembles","authors":"Peter Bro Miltersen","doi":"10.1109/SCT.1991.160257","DOIUrl":"https://doi.org/10.1109/SCT.1991.160257","url":null,"abstract":"The author analyzes the concept of malignness, which is the property of probability ensembles making the average case running time equal to the worst-case running time for a class of algorithms. He derives lower and upper bounds on the complexity of malign ensembles, which are tight for exponential time algorithms and which show that no polynomial time computable malign ensemble exists for the class of polynomial time algorithms. Furthermore, he shows that for no class of superlinear algorithms does a polynomial time computable malign ensemble exist, unless every language in P has an expected polynomial time constructor.<<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":"1990-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114909574","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}
引用次数: 21
Capturing complexity classes by fragments of second order logic 通过二阶逻辑片段捕获复杂度类
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1900-01-01 DOI: 10.1109/SCT.1991.160279
E. Gradel
{"title":"Capturing complexity classes by fragments of second order logic","authors":"E. Gradel","doi":"10.1109/SCT.1991.160279","DOIUrl":"https://doi.org/10.1109/SCT.1991.160279","url":null,"abstract":"The expressive power of certain fragments of second-order logic on finite structures is investigated. The fragments are second-order Horn logic, second-order Krom logic, and a symmetric and a deterministic version of the latter. It is shown that all these logics collapse to their existential fragments. In the presence of a successor relation they provide characterizations of polynomial time, deterministic and nondeterministic logspace and of the complement of symmetric logspace. Without a successor relation these logics can still express certain problems that are complete in the corresponding complexity classes, but they are strictly weaker than previously known logics for these classes and fail to express some very simple properties.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"140 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":"123313491","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}
引用次数: 1
首页 上一页
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学术官方微信