A quantifier characterization for nondeterministic log space

Authors:
Richard J. Lipton;Nancy Lynch
Affiliations:
Yale University, New Haven, Connecticut;University of Southern California, Los Angeles, California
Venue:
ACM SIGACT News
Year:
1975

Citing 3
Cited 0

Complete problems for deterministic polynomial time

STOC '74 Proceedings of the sixth 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

Quantified Score

Hi-index	0.00

Visualization

Abstract