A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
On the Difference Between One and Many (Preliminary Version)
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
Reducibility, randomness, and intractibility (Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On Some Central Problems in Computational Complexity
On Some Central Problems in Computational Complexity
Space-bounded hierarchies and probabilistic computations
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
Theoretical Computer Science
| Hi-index | 0.00 |
For tape constructible functions S(n)≥log n, if a language L is accepted by an S(n) tape bounded probabilistic Turing machine, then there is an S(n) tape bounded probabilistic Turing machine that accepts &Lmarc;, the complement of L.