COVERING A SET WITH ARITHMETIC PROGRESSIONS IS NP-COMPLETE

被引：0
|
作者：
HEATH, LS
机构：
来源：
INFORMATION PROCESSING LETTERS | 1990年 / 34卷 / 06期
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：293 / 298
页数：6
相关论文
共 50 条
  • [31] Splitting NP-complete sets
    Glasser, Christian
    Pavan, A.
    Selman, Alan L.
    Zhang, Liyu
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 37 (05) : 1517 - 1535
  • [32] ON ONE NP-COMPLETE PROBLEM
    DEMEL, J
    DEMLOVA, M
    [J]. KYBERNETIKA, 1995, 31 (02) : 207 - 211
  • [33] System BV is NP-complete
    Kahramanogullari, Ozan
    [J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 143 : 87 - 99
  • [34] Decidability of NP-Complete Problems
    A. A. Vagis
    A. M. Gupal
    [J]. Cybernetics and Systems Analysis, 2022, 58 : 914 - 916
  • [35] AN NP-COMPLETE MATCHING PROBLEM
    PLAISTED, DA
    ZAKS, S
    [J]. DISCRETE APPLIED MATHEMATICS, 1980, 2 (01) : 65 - 72
  • [36] Choco Banana is NP-Complete∗
    Iwamoto, Chuzo
    Tokunaga, Takeru
    [J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2024, E107A (09) : 1488 - 1491
  • [37] Entropy for NP-complete problems
    Levchenkov, V.S.
    [J]. Doklady Akademii Nauk, 2001, 376 (02) : 175 - 178
  • [38] Properties of NP-complete sets
    Glasser, C
    Pavan, A
    Selman, AL
    Sengupta, S
    [J]. 19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 184 - 197
  • [39] CROSSING NUMBER IS NP-COMPLETE
    GAREY, MR
    JOHNSON, DS
    [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (03): : 312 - 316
  • [40] Splitting number is NP-complete
    Faria, L
    de Figueiredo, CMH
    Mendonça, CFX
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1998, 1517 : 285 - 297
12345