Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)最新文献

Proofs, codes, and polynomial-time reducibilities 证明，代码，和多项式时间的可约性

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) Pub Date : 1999-05-04 DOI: 10.1109/CCC.1999.766261

Ravi Kumar, D. Sivakumar

引用次数: 29

Upper semilattice of binary strings with the relation "x is simple conditional to y" 关系为“x是y的简单条件”的二元字符串的上半格

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) Pub Date : 1999-05-04 DOI: 10.1109/CCC.1999.766270

A. Muchnik, Andrei E. Romashchenko, A. Shen, N. Vereshchagin

引用次数: 32

Deterministic amplification of space-bounded probabilistic algorithms 空间有界概率算法的确定性放大

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) Pub Date : 1999-05-04 DOI: 10.1109/CCC.1999.766276

Ziv Bar-Yossef, Oded Goldreich, A. Wigderson

{"title":"Deterministic amplification of space-bounded probabilistic algorithms","authors":"Ziv Bar-Yossef, Oded Goldreich, A. Wigderson","doi":"10.1109/CCC.1999.766276","DOIUrl":"https://doi.org/10.1109/CCC.1999.766276","url":null,"abstract":"This paper initiates the study of deterministic amplification of space-bounded probabilistic algorithms. The straightforward implementations of known amplification methods cannot be used for such algorithms, since they consume too much space. We present a new implementation of the Ajtai-Komlos-Szemeredi method, that enables to amplify an S-space algorithm that uses r random bits and errs with probability /spl epsiv/ to an O(kS)-space algorithm that uses r+O(k) random bits and errs with probability /spl epsiv//sup /spl Omega/(k)/. This method can be used to reduce the error probability of BPL algorithms below any constant, with only a constant addition of new random bits. This is weaker than the exponential reduction that can be achieved for BPP algorithms by methods that use only O(r) random bits. However we prove that any black-box amplification method that uses O(r) random bits and makes at most p parallel simulations reduces the error to at most /spl epsiv//sup O(p)/. Hence, in BPL, where p should be a constant, the error cannot be reduced to less than a constant. This means that our method is optimal with respect to black-box amplification methods, that use O(r) random bits. The new implementation of the AKS method is based on explicit constructions of constant-space online extractors and online expanders. These are extractors and expanders, for which neighborhoods can be computed in a constant space by a Turing machine with a one-way input tape.","PeriodicalId":432015,"journal":{"name":"Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127764122","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

Stronger separations for random-self-reducibility, rounds, and advice 更强的随机自约性、轮询和通知分离

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) Pub Date : 1999-05-04 DOI: 10.1109/CCC.1999.766268

L. Babai, Sophie Laplante

引用次数: 7

On monotone planar circuits 单调平面电路

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) Pub Date : 1999-05-04 DOI: 10.1109/CCC.1999.766259

D. A. Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum

引用次数: 31

Some recent progress on the complexity of lattice problems 关于格问题复杂性的一些最新进展

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) Pub Date : 1999-05-04 DOI: 10.1109/CCC.1999.766274

Jin-Yi Cai

引用次数: 27

Applications of a new transference theorem to Ajtai's connection factor 一个新的转移定理在Ajtai连接因子中的应用

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) Pub Date : 1999-05-04 DOI: 10.1109/CCC.1999.766278

Jin-Yi Cai

引用次数: 16

Query order and NP-completeness 查询顺序和np完备性

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) Pub Date : 1999-05-04 DOI: 10.1109/CCC.1999.766272

J. J. Dai, J. H. Lutz

引用次数: 4

Learning DNF by approximating inclusion-exclusion formulae 通过近似包容-排除公式学习DNF

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) Pub Date : 1999-05-04 DOI: 10.1109/CCC.1999.766279

J. Tarui, Tatsuie Tsukiji

引用次数: 23

A lower bound for primality 原数的下界

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) Pub Date : 1999-05-04 DOI: 10.1109/CCC.1999.766257

E. Allender, M. Saks, I. Shparlinski

引用次数: 22