Advances In Computational Complexity Theory最新文献

筛选
英文 中文
On Strong Separations from AC 关于与AC的强分离
Advances In Computational Complexity Theory Pub Date : 1993-10-25 DOI: 10.1090/dimacs/013/02
E. Allender, Vivek Gore
{"title":"On Strong Separations from AC","authors":"E. Allender, Vivek Gore","doi":"10.1090/dimacs/013/02","DOIUrl":"https://doi.org/10.1090/dimacs/013/02","url":null,"abstract":"1 SUMMARY As part of a study of almost-everywhere complex sets, we i n vestigate sets that are immune to AC 0 ; that is, sets with no innnite subset in AC 0. W e show that such sets exist in P PP and in DSPACElog n log n. Our main result is an oracle construction indicating that any improvement in these immunity results will represent a signiicant advance, in that we show that any answer to the question: Are there sets in NP that are immune to AC 0 ? will provide non-relativizable proof techniques suitable for attacking the Ntime vs Dtime question. That is, we show that the existence or nonexistence of AC 0-immune sets in NP has consequences concerning the complexity of sets in deterministic and nondeterministic exponential time.","PeriodicalId":264668,"journal":{"name":"Advances In Computational Complexity Theory","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126955289","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
A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications 一个新的只读一次分支程序下界定理及其应用
Advances In Computational Complexity Theory Pub Date : 1992-02-10 DOI: 10.1090/dimacs/013/11
Janos Simon, M. Szegedy
{"title":"A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications","authors":"Janos Simon, M. Szegedy","doi":"10.1090/dimacs/013/11","DOIUrl":"https://doi.org/10.1090/dimacs/013/11","url":null,"abstract":"","PeriodicalId":264668,"journal":{"name":"Advances In Computational Complexity Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124324555","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}
引用次数: 52
Parallel Matching Complexity of Ramsey's Theorem Ramsey定理的并行匹配复杂度
Advances In Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/dimacs/013/03
J. Beck
{"title":"Parallel Matching Complexity of Ramsey's Theorem","authors":"J. Beck","doi":"10.1090/dimacs/013/03","DOIUrl":"https://doi.org/10.1090/dimacs/013/03","url":null,"abstract":"","PeriodicalId":264668,"journal":{"name":"Advances In Computational Complexity Theory","volume":"458 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":"132815480","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
Fair Games against an All-Powerful Adversary 公平游戏对抗全能的对手
Advances In Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/dimacs/013/09
R. Ostrovsky, R. Venkatesan, M. Yung
{"title":"Fair Games against an All-Powerful Adversary","authors":"R. Ostrovsky, R. Venkatesan, M. Yung","doi":"10.1090/dimacs/013/09","DOIUrl":"https://doi.org/10.1090/dimacs/013/09","url":null,"abstract":"Suppose that a weak (i.e., polynomially-bounded) device needs to interact over a clear channel with an infinitely-powerful and adversarial device which he does not trust. Notice that throughout this interaction (game) the infinitely-powerful device can hide information from the weak device using encryption. The weak device, however, is not so fortunate: to keep the game fair, he must hide information from the strong device in the information-theoretic sense. Nevertheless, we show that the weak player can play any polynomial length partial-information game (or secure protocol) with the strong player using any one-way function. More specifically, we show that oblivious transfer protocol can be implemented in this model using any one-way function and we establish related impossibility results concerning oblivious transfer.","PeriodicalId":264668,"journal":{"name":"Advances In Computational Complexity Theory","volume":"56 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":"133874249","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}
引用次数: 77
An Application of Game-Theoretic Techniques to Cryptography 博弈论技术在密码学中的应用
Advances In Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/dimacs/013/06
M. Fischer, R. Wright
{"title":"An Application of Game-Theoretic Techniques to Cryptography","authors":"M. Fischer, R. Wright","doi":"10.1090/dimacs/013/06","DOIUrl":"https://doi.org/10.1090/dimacs/013/06","url":null,"abstract":"This paper provides an application of game theoretic techniques to the analysis of a class of multiparty cryptographic protocols for secret bit exchange.","PeriodicalId":264668,"journal":{"name":"Advances In Computational Complexity Theory","volume":"29 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":"132557584","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}
引用次数: 37
On Algorithms for Simple Stochastic Games 关于简单随机对策的算法
Advances In Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/dimacs/013/04
A. Condon
{"title":"On Algorithms for Simple Stochastic Games","authors":"A. Condon","doi":"10.1090/dimacs/013/04","DOIUrl":"https://doi.org/10.1090/dimacs/013/04","url":null,"abstract":"We survey a number of algorithms for the simple stochastic game problem, which is to determine the winning probability of a type of stochastic process, where the transitions are partially controlled by two players. We show that four natural approaches to solving the problem are incorrect, and present two new algorithms for the problem. The rst reduces the problem to that of nding a locally optimal solution to a (non-convex) quadratic program with linear constraints. The second extends a technique of Shapley called the successive approximation technique, by using linear programming to maximize the improvement at each approximation step. Finally, we analyze a randomized variant of the Hooman-Karp strategy improvement algorithm.","PeriodicalId":264668,"journal":{"name":"Advances In Computational Complexity Theory","volume":"23 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":"133615769","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}
引用次数: 194
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation 通过丢番图近似分解整数和计算离散对数
Advances In Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/dimacs/013/10
C. Schnorr
{"title":"Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation","authors":"C. Schnorr","doi":"10.1090/dimacs/013/10","DOIUrl":"https://doi.org/10.1090/dimacs/013/10","url":null,"abstract":"","PeriodicalId":264668,"journal":{"name":"Advances In Computational Complexity Theory","volume":"17 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":"122811393","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 the E-Isomorphism Problem 关于e -同构问题
Advances In Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/dimacs/013/12
Jie Wang
{"title":"On the E-Isomorphism Problem","authors":"Jie Wang","doi":"10.1090/dimacs/013/12","DOIUrl":"https://doi.org/10.1090/dimacs/013/12","url":null,"abstract":"","PeriodicalId":264668,"journal":{"name":"Advances In Computational Complexity Theory","volume":"18 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":"127421457","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
Practical Perfect Cryptographic Security 实用完美的加密安全
Advances In Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/dimacs/013/08
U. Maurer
{"title":"Practical Perfect Cryptographic Security","authors":"U. Maurer","doi":"10.1090/dimacs/013/08","DOIUrl":"https://doi.org/10.1090/dimacs/013/08","url":null,"abstract":"","PeriodicalId":264668,"journal":{"name":"Advances In Computational Complexity Theory","volume":"9 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":"133608293","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
Composition of the Universal Relation 宇宙关系的构成
Advances In Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/dimacs/013/07
J. Håstad, A. Wigderson
{"title":"Composition of the Universal Relation","authors":"J. Håstad, A. Wigderson","doi":"10.1090/dimacs/013/07","DOIUrl":"https://doi.org/10.1090/dimacs/013/07","url":null,"abstract":"We prove that the communication complexity of the k-fold composition of the universal relation on n bits is (1 − o(1))kn when k = o( √","PeriodicalId":264668,"journal":{"name":"Advances In Computational Complexity Theory","volume":"89 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":"122504554","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}
引用次数: 56
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书