L. Adleman. Two theorems on random polynomial time. FOCS 78. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Links Between Complexity Theory and Constrained Block Coding - Stockmeyer, Modha (2002) (Correct)
On Being Incoherent Without Being Very Hard - Beigel, Feigenbaum (1992) (16 citations) (Correct)
NP-hard Sets are P-Superterse Unless R = NP - Beigel (1988) (25 citations) (Correct)
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich, Sudan (1995) (9 citations) (Correct)
Randomization and Derandomization in Space-Bounded Computation - Saks (1996) (14 citations) (Correct)
A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) (Correct)
Pseudorandom generators without the XOR Lemma - Sudan, Trevisan, Vadhan (2000) (38 citations) (Correct)
Hardness of Approximating the Minimum Distance of a Linear Code - Ilya Dumer Daniele (4 citations) (Correct)
On the Complexity of Some Arithmetic Problems over F2[T] - Allender, Bernasconi, Damm, .. (Correct)
Simple Strategies for Large Zero-Sum Games with Applications.. - Lipton, Young (1994) (7 citations) (Correct)
Code-Based Game-Playing Proofs and the Security of Triple.. - Bellare, Rogaway (2006) (Correct)
Cryptography in the Multi-string Model - Jens Groth Rafail (Correct)
The Game-Playing Technique - Bellare, Rogaway (2004) (1 citation) (Correct)
Nonuniform Hard Boolean Functions and Uniform Complexity Classes - Kabanets (2001) (Correct)
Free Bits, PCPs and Non-Approximability--- - Towards Tight Results (Correct)
A Lower Bound for Primality - Eric Allender Dept (1999) (2 citations) (Correct)
Bounded Arithmetic, Cryptography and Complexity - Buss (Correct)
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich.. (1995) (9 citations) (Correct)
Derandomization That is Rarely Wrong From Short Advice.. - Goldreich, Wigderson (2002) (Correct)
Constructing Small Sample Spaces Satisfying Given - Constraints Daphne Koller (Correct)
Free Bits, PCPs and Non-Approximability--- - Towards Tight Results (Correct)
Lecture Notes on Computational Complexity - Trevisan (2004) (Correct)
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich.. (1995) (9 citations) (Correct)
Circuit Complexity - Krause, Wegener (Correct)
Hardness of Approximating the Minimum Distance of a Linear.. - Dumer, Micciancio, Sudan (2001) (4 citations) (Correct)
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC