Structure Preserving Reductions among Convex Optimization Problems
暂无分享,去创建一个
[1] Juris Hartmanis,et al. On polynomial time isomorphisms of complete sets , 1977, Theoretical Computer Science.
[2] Giorgio Ausiello,et al. On the Structure of Combinatorial Problems and Structure Preserving Reductions , 1977, ICALP.
[3] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[4] David S. Johnson,et al. The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.
[5] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[6] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.
[7] Giorgio Ausiello,et al. Classes of Structurally Isomorphic {NP}-Optimization Problems , 1977, MFCS.
[8] Juris Hartmanis,et al. On isomorphisms and density of NP and other complete sets , 1976, STOC '76.
[9] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[10] Janos Simon. On some central problems in computational complexity , 1975 .