Subject
General Computer Science,Theoretical Computer Science
Reference10 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1974
2. Relativizations of the P = ? NP question;Baker;SIAM J. Comput.,1975
3. The complexity of theorem proving procedures;Cook;Proc. Third Annual ACM Symposium on Theory of Computing,1971
4. On the relation of deterministic and nondeterministic complexity classes;Dekhtyar,1976
5. Arithmetization of metamathematics in a general setting;Feferman;Fund. Math.,1960
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献