How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Randomness conservation inequalities; information and independence in mathematical theories
Information and Control
Complexity and structure
Almost all primes can be quickly certified
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Resource bounded Kolmogorov complexity, a link between computational complexity and information theory
The complexity of sparse sets in P
Proc. of the conference on Structure in complexity theory
Resource-bounded Kolmogorov complexity of hard languages
Proc. of the conference on Structure in complexity theory
What is a hard instance of a computational problem?
Proc. of the conference on Structure in complexity theory
One-way functions and pseudorandom generators
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On generalized Kolmogorov complexity
3rd annual symposium on theoretical aspects of computer science on STACS 86
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
On the generation of cryptographically strong pseudorandom sequences
ACM Transactions on Computer Systems (TOCS)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Succinct representation random strings, and complexity classes
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Randomness and the density of hard problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Generalized Kolmogorov complexity and the structure of feasible computations
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Deterministic simulation of probabilistic constant depth circuits
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
| Hi-index | 0.01 |
If secure pseudorandom generators exist, then probabilistic computation does not uniformly speed up deterministic computation. If sets in P must contain infinitely many noncomplex strings, then nondeterministic computation does not uniformly speed up deterministic computation. Connections are drawn between pseudorandom generation, generalized Kolmogorov complexity, and immunity properties of complexity classes.