Randomness - A Computational Complexity Perspective
暂无分享,去创建一个
[1] Avi Wigderson,et al. P , NP and mathematics – a computational complexity perspective , 2006 .
[2] Martin E. Dyer,et al. A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.
[3] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[4] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[5] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[6] Oded Goldreich,et al. Modern Cryptography, Probabilistic Proofs and Pseudorandomness , 1998, Algorithms and Combinatorics.
[7] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[8] Paul S. Wang,et al. Polynomial Factorization Sharp Bounds, Efficient Algorithms , 1993, J. Symb. Comput..
[9] L. Fortnow. Recent Developments in Explicit Constructions of Extractors , 2002 .
[10] M. Rabin. Probabilistic algorithm for testing primality , 1980 .
[11] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..
[12] Avi Wigderson,et al. Randomness vs. time: de-randomization under a uniform assumption , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[13] R. Impagliazzo,et al. P=BPP unless E has sub-exponential circuits: Derandomizing the XOR Lemma , 2002 .
[14] John Gill,et al. Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..
[15] Oded Goldreich,et al. Computational complexity: a conceptual perspective , 2008, SIGA.
[16] Manindra Agrawal,et al. PRIMES is in P , 2004 .
[17] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[18] Eric Vigoda,et al. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.