On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Polynomial reducibilities and upward diagonalizations
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On some subrecursive reducibilities.
On some subrecursive reducibilities.
Unambiguous Functions in Logarithmic Space
Fundamenta Informaticae
| Hi-index | 0.00 |