The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE
WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE
The existence and density of generalized complexity cores
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Hard-core theorems for complexity classes
Journal of the ACM (JACM)
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Polynomial reducibilities and upward diagonalizations
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Resource bounded immunity and simplicity
Theoretical Computer Science
Complexity-class-encoding sets
Journal of Computer and System Sciences
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
| Hi-index | 0.01 |