Documents Related by Co-Citation

10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
125 Derandomizing polynomial identity testing means proving circuit lower bounds – V Kabanets, R Impagliazzo
237 Probabilistic algorithms for sparse polynomials – R Zippel - 1979
395 Fast probabilistic algorithms for verification of polynomial identities – J. T. Schwartz - 1980
173 Natural Proofs – Alexander A. Razborov, Steven Rudich - 1994
25 Algorithmic Number Theory, Vol. I: Efficient Algorithms – Eric Bach, Jeff Shallit - 1996
71 There are infinitely many Carmichael numbers – W. R. Alford, Andrew Granville, Carl Pomerance - 1982
2895 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – R.L. Rivest, A. Shamir, L. Adleman - 1978
207 Riemann’s hypothesis and tests for primality – Gary L Miller - 1976
23 Reducing Randomness Via Irrational Numbers – Zhi-zhong Chen, Ming-Yang Kao - 1997
22 Checking polynomial identities over any field: Towards a derandomization – Daniel Lewin - 1998
706 Factoring polynomials with rational coefficients – A. K. Lenstra, H. W. Lenstra - 1982
718 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
305 Algebraic Methods for Interactive Proof Systems – Carsten Lund, Lance Fortnow, Howard Karloff, Noam Nisan - 1990
284 Hardness vs. randomness – Noam Nisan - 1994
4 Factoring polynomials over p-adic fields,” Algorithmic number theory – David G Cantor, Daniel M Gordon - 2000
12 Computing Logarithm Intervals with the Arithmetic-Geometric Mean Iterations,” available from http://cr.yp.to/papers.html – Daniel J Bernstein
918 A Course in Computational Algebraic Number Theory, Graduate Texts – H Cohen - 1993
229 Randomness is Linear in Space – Noam Nisan, David Zuckerman - 1993