Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. On languages accepted in polynomial time;Book;SIAM J. Comput.,1972
2. Comparing complexity classes;Book;J. Comput. System Sci.,1974
3. The intrinsic computational difficulty of functions;Cobham,1964
4. Characterizations of pushdown machines in terms of time-bounded computers;Cook;J. ACM,1971
5. The complexity of theorem-proving procedures;Cook;Proc. Third ACM Symposium on Theory of Computing,1971
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献