Documents Related by Co-Citation

10870 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
125 Derandomizing polynomial identity tests means proving circuit lower bounds – Valentine Kabanets, Russell Impagliazzo - 2003
205 Riemann’s hypothesis and tests for primality – G L Miller
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
235 Probabilistic algorithms for sparse polynomials – R Zippel - 1979
392 Fast probabilistic algorithms for verification of polynomial identities – J. T. Schwartz - 1980
171 Natural Proofs – Alexander A. Razborov, Steven Rudich - 1994
2890 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – R.L. Rivest, A. Shamir, L. Adleman - 1978
30 Randomness Efficient Identity Testing of Multivariate Polynomials – Adam R. Klivans, Daniel A. Spielman
162 Matching is as Easy as Matrix Inversion – Ketan Mulmuley, et al. - 1987
27 Primality and identity testing via Chinese Remaindering – M Agrawal, S Biswas - 2003
31 Proving lower bounds via pseudo-random generators – Manindra Agrawal - 2005
22 Randomness-optimal unique element isolation with applications to perfect matching and related problems – S Chari, P Rohatgi, A Srinivasan - 1995
23 Polynomial identity testing for depth 3 circuits – Neeraj Kayal, Shubhangi Saraf - 2006
58 On determinants, matchings, and random algorithms – L Lovász - 1979
1428 Reducibility among combinatorial problems – R Karp - 1972
562 A Decision Method for Elementary Algebra and Geometry – A Tarski - 1951
772 The complexity of theorem-proving procedures – Stephen A. Cook - 1971