Author:
Ladner Richard E.,Lynch Nancy A.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference22 articles.
1. T. Baker, J. Gill, andR. Solovay, Relativizations of the question. To appear inSIAM Journal on Computing.
2. S. A. Cook, Characterizations of pushdown machines in terms of time-bounded computers,Journal of the ACM,18 (1971) 4–18.
3. S. A. Cook, The complexity of theorem proving procedures,Proc. Third Annual ACM Symposium on Theory of Computing, 1971 pp. 151–158.
4. S. A. Cook, An observation on time-storage trade off,Proc. of Fifth Annual ACM Symposium on Theory of Computing, 1973 pp. 29–33.
5. J. Hartmanis, On nondeterminacy of simple computing devices,Acta Informatica,1 (1972) 336–344.
Cited by
129 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献