THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE

被引：38

|

作者：

JOHNSON, DS ^{[1
]}

机构：

[1] AT&T BELL LABS,MURRAY HILL,NJ 07974

来源：

JOURNAL OF ALGORITHMS | 1987年 / 8卷 / 02期

关键词：

D O I：

10.1016/0196-6774(87)90043-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：285 / 303

页数：19

相关论文

共 50 条

[21] THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE
JOHNSON, DS
JOURNAL OF ALGORITHMS, 1985, 6 (02) : 291 - 305
[22] THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE
JOHNSON, DS
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1992, 13 (03): : 502 - 524
[23] The NP-Completeness Column
Johnson, David S.
ACM TRANSACTIONS ON ALGORITHMS, 2005, 1 (01) : 160 - 176
[24] The NP-completeness column: The many limits on approximation
Johnson, David S.
ACM Trans. Algorithms, 1600, 3 (473-489):
[25] The NP-Completeness Column: The Many Limits on Approximation
Johnson, David S.
ACM TRANSACTIONS ON ALGORITHMS, 2006, 2 (03) : 473 - 489
[26] The NP-Completeness Column: Finding Needles in Haystacks
Johnson, David S.
ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (02)
[27] NP-COMPLETENESS
SCHNEIER, B
DR DOBBS JOURNAL, 1994, 19 (10): : 119 - 121
[28] On a criterion of NP-completeness
Bulitko V.K.
Bulitko V.V.
Ukrainian Mathematical Journal, 1998, 50 (12) : 1924 - 1928
[29] CONTRACTIBILITY AND NP-COMPLETENESS
BROUWER, AE
VELDMAN, HJ
JOURNAL OF GRAPH THEORY, 1987, 11 (01) : 71 - 79
[30] NP-completeness: A retrospective
Papadimitriou, CH
AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 2 - 6

← 1 2 3 4 5 →