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 条
  • [41] Nonuniform Reductions and NP-Completeness
    John M. Hitchcock
    Hadi Shafei
    Theory of Computing Systems, 2022, 66 : 743 - 757
  • [42] Nonuniform Reductions and NP-Completeness
    Hitchcock, John M.
    Shafei, Hadi
    THEORY OF COMPUTING SYSTEMS, 2022, 66 (04) : 743 - 757
  • [43] Query order and NP-completeness
    Dai, JJ
    Lutz, JH
    FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 142 - 148
  • [44] AN ELEMENTARY APPROACH TO NP-COMPLETENESS
    AUSTIN, AK
    AMERICAN MATHEMATICAL MONTHLY, 1983, 90 (06): : 398 - 399
  • [45] Nonuniform Reductions and NP-Completeness
    Hitchcock, John M.
    Shafei, Hadi
    35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
  • [46] NP-Completeness in the gossip monoid
    Fenner, Peter
    Johnson, Marianne
    Kambites, Mark
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2018, 28 (04) : 653 - 672
  • [47] Selfish splittable flows and NP-completeness
    Kaporis, A. C.
    Spirakis, P. G.
    COMPUTER SCIENCE REVIEW, 2011, 5 (03) : 209 - 228
  • [48] NP-Completeness Not the Same as Separating P from NP
    Mukund, Madhavan
    COMMUNICATIONS OF THE ACM, 2009, 52 (04) : 9 - 9
  • [49] Pancyclicity and NP-completeness in planar graphs
    Li, MC
    Corneil, DG
    Mendelsohn, E
    DISCRETE APPLIED MATHEMATICS, 2000, 98 (03) : 219 - 225
  • [50] THE NP-COMPLETENESS OF EDGE-COLORING
    HOLYER, I
    SIAM JOURNAL ON COMPUTING, 1981, 10 (04) : 718 - 720
12345