Subject
General Computer Science,Theoretical Computer Science
Reference4 articles.
1. The complexity of theorem proving procedures;Cook;Proc. 3rd Ann. ACM Symp. on Theor. Comput.,1971
2. Reducibility among combinatorial problems;Karp,1972
3. Partial and complete cyclic orders;Meggido;Bull. Am. Math. Soc.,1976
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献