共 50 条
- [42] Embedding into l∞2 Is Easy, Embedding into l∞3 Is NP-Complete Discrete & Computational Geometry, 2008, 39 : 747 - 765
- [45] Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete Discrete & Computational Geometry, 2024, 71 : 893 - 917
- [48] Register Reassignment for Mixed-width ISAs is an NP-Complete Problem IMCIC 2010: INTERNATIONAL MULTI-CONFERENCE ON COMPLEXITY, INFORMATICS AND CYBERNETICS, VOL I (POST-CONFERENCE EDITION), 2010, : 139 - 143
- [49] Tree Convex Bipartite Graphs: NP-Complete Domination, Hamiltonicity and Treewidth FRONTIERS IN ALGORITHMICS, FAW 2014, 2014, 8497 : 252 - 263
- [50] LINEARLY-GROWING REDUCTIONS OF KARP'S 21 NP-COMPLETE PROBLEMS NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2018, 8 (01): : 1 - 16