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 条
  • [31] Separation of NP-completeness notions
    Pavan, A
    Selman, AL
    SIAM JOURNAL ON COMPUTING, 2002, 31 (03) : 906 - 918
  • [32] Brick wall: NP-completeness
    Franco, John
    IEEE Potentials, 1997, 16 (04): : 37 - 40
  • [33] SUBPROBLEMS AND NP-COMPLETENESS THEORY
    Su, Li Sek
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2006, (90): : 192 - 198
  • [34] Separation of NP-completeness notions
    Pavan, A
    Selman, AL
    16TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 78 - 89
  • [35] NP-completeness of kSAT and multifractals
    Sato, Y
    Taiji, M
    Ikegami, T
    COMPUTER PHYSICS COMMUNICATIONS, 1999, 121 : 51 - 53
  • [36] On NP-completeness for linear machines
    Gassner, C
    JOURNAL OF COMPLEXITY, 1997, 13 (02) : 259 - 271
  • [37] NP-completeness of the game Kingdomino™
    Viet-Ha Nguyen
    Perrot, Kevin
    Vallet, Mathieu
    THEORETICAL COMPUTER SCIENCE, 2020, 822 : 23 - 35
  • [38] ON NP-COMPLETENESS IN LINEAR LOGIC
    KOPYLOV, AP
    ANNALS OF PURE AND APPLIED LOGIC, 1995, 75 (1-2) : 137 - 152
  • [39] NP-COMPLETENESS AND DEGREES OF SATISFACTION
    LIEBERHERR, K
    JOURNAL OF SYMBOLIC LOGIC, 1977, 42 (03) : 457 - 457
  • [40] NP-completeness in hedonic games
    Ballester, C
    GAMES AND ECONOMIC BEHAVIOR, 2004, 49 (01) : 1 - 30
12345