Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference7 articles.
1. A machine-independent theory of the complexity of recursive functions;Blum;J. Assoc. Comput. Mach.,1967
2. The complexity of theorem-proving procedures;Cook,1971
3. The Mathematical Theory of Context-Free Languages;Ginsburg,1966
4. On the computational complexity of algorithms;Hartmanis;Trans. Amer. Math. Soc.,1965
5. On the structure of polynomial time reducibility;Ladner;J. Assoc. Comput. Mach.,1975
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献