NP-COMPLETENESS PROPERTIES ABOUT LINEAR EXTENSIONS

被引:16
|
作者
BOUCHITTE, V
HABIB, M
机构
[1] ECOLE MINES ST ETIENNE, DEPT INFORMAT APPL, F-42023 ST ETIENNE 2, FRANCE
[2] ECOLE NATL SUPER TELECOMMUN BRETAGNE, DEPT INFORMAT & RESEAUX, COMMUN LAB, F-29285 BREST, FRANCE
[3] UNIV BRETAGNE OCCIDENTALE, COMMUN LAB, F-29279 BREST, FRANCE
关键词
D O I
10.1007/BF00337693
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:143 / 154
页数:12
相关论文
共 50 条
  • [11] Brick wall: NP-completeness
    Franco, John
    IEEE Potentials, 1997, 16 (04): : 37 - 40
  • [12] SUBPROBLEMS AND NP-COMPLETENESS THEORY
    Su, Li Sek
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2006, (90): : 192 - 198
  • [13] Separation of NP-completeness notions
    Pavan, A
    Selman, AL
    16TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 78 - 89
  • [14] NP-completeness of kSAT and multifractals
    Sato, Y
    Taiji, M
    Ikegami, T
    COMPUTER PHYSICS COMMUNICATIONS, 1999, 121 : 51 - 53
  • [15] NP-completeness of the game Kingdomino™
    Viet-Ha Nguyen
    Perrot, Kevin
    Vallet, Mathieu
    THEORETICAL COMPUTER SCIENCE, 2020, 822 : 23 - 35
  • [16] NP-COMPLETENESS AND DEGREES OF SATISFACTION
    LIEBERHERR, K
    JOURNAL OF SYMBOLIC LOGIC, 1977, 42 (03) : 457 - 457
  • [17] NP-completeness in hedonic games
    Ballester, C
    GAMES AND ECONOMIC BEHAVIOR, 2004, 49 (01) : 1 - 30
  • [18] Nonuniform Reductions and NP-Completeness
    John M. Hitchcock
    Hadi Shafei
    Theory of Computing Systems, 2022, 66 : 743 - 757
  • [19] Nonuniform Reductions and NP-Completeness
    Hitchcock, John M.
    Shafei, Hadi
    THEORY OF COMPUTING SYSTEMS, 2022, 66 (04) : 743 - 757
  • [20] Query order and NP-completeness
    Dai, JJ
    Lutz, JH
    FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 142 - 148