Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
A Note Concerning Nondeterministic Tape Complexities
Journal of the ACM (JACM)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Translational methods and computational complexity
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Journal of Computer and System Sciences
On the complexity of model expansion
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Separating NE from some nonuniform nondeterministic complexity classes
Journal of Combinatorial Optimization
Hierarchies of DLOGTIME-uniform circuits
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
NE is not NP turing reducible to nonexponentially dense NP sets
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Hierarchies in Dependence Logic
ACM Transactions on Computational Logic (TOCL)
Time hierarchies for sampling distributions
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
We prove the following theorem in this paper: For any real numbers r"1, r"2, 1@?r"1