Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999
2. Structural Complexity I;Balcazar,1988
3. Introduction to the theory of complexity;Bovet,1993
4. S.A. Cook, The complexity of theorem-proving procedures, Proc. 3rd ACM Symp. on Theory of Computing, 1971, pp. 151–158.
5. Completeness in approximation classes;Crescenzi;Informat. and Comput.,1991
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献