A characterization of log-space computable functions

Authors:
John Lind;Albert R. Meyer
Affiliations:
Massachusetts Institute of Technology;Massachusetts Institute of Technology
Venue:
ACM SIGACT News
Year:
1973

Citing 2
Cited 1

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

Ramified Corecurrence and Logspace

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract