P-Complete Problems and Approximate Solutions
暂无分享,去创建一个
[1] Lawrence Bodin,et al. A graph theoretic approach to the grouping of ordering data , 1972, Networks.
[2] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[3] Sartaj Sahni,et al. Computationally Related Problems , 1974, SIAM J. Comput..
[4] D. E. Knuth,et al. A terminological proposal , 1974, SIGA.
[5] Sartaj Sahni,et al. Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.
[6] David S. Johnson. Approximation algorithms for combinatorial problems , 1973, STOC '73.