Some consequences of the existence of pseudorandom generators
- 31 August 1989
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 39 (1) , 101-124
- https://doi.org/10.1016/0022-0000(89)90021-4
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the notion of infinite pseudorandom sequencesTheoretical Computer Science, 1986
- Sets with small generalized Kolmogorov complexityActa Informatica, 1986
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- Computation times of NP sets of different densitiesTheoretical Computer Science, 1984
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966