Hardness vs randomness
- 31 October 1994
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 49 (2), 149-167
- https://doi.org/10.1016/s0022-0000(05)80043-1
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (CCR8612563)
- Israel Academy of Sciences and Humanities (328071)
This publication has 17 references indexed in Scilit:
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Pseudorandom bits for constant depth circuitsCombinatorica, 1991
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- A Note on Randomized Polynomial TimeSIAM Journal on Computing, 1987
- Pseudorandom number generation and space complexityInformation and Control, 1985
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- On the generation of cryptographically strong pseudo-random sequencesLecture Notes in Computer Science, 1981
- AlternationJournal of the ACM, 1981
- The polynomial-time hierarchyTheoretical Computer Science, 1976