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 条
  • [1] OPTIMAL PACKING AND COVERING IN THE PLANE ARE NP-COMPLETE
    FOWLER, RJ
    PATERSON, MS
    TANIMOTO, SL
    [J]. INFORMATION PROCESSING LETTERS, 1981, 12 (03) : 133 - 137
  • [2] A covering problem that is easy for trees but NP-complete for trivalent graphs
    Bardeli, Rolf
    Clausen, Michael
    Ribbrock, Andreas
    [J]. DISCRETE APPLIED MATHEMATICS, 2008, 156 (15) : 2855 - 2866
  • [3] Feedback arc set in bipartite tournaments is NP-complete
    Guo, Jiong
    Hueffner, Falk
    Moser, Hannes
    [J]. INFORMATION PROCESSING LETTERS, 2007, 102 (2-3) : 62 - 65
  • [4] Covering intervals with arithmetic progressions
    P. Balister
    B. Bollobás
    R. Morris
    J. Sahasrabudhe
    M. Tiba
    [J]. Acta Mathematica Hungarica, 2020, 161 : 197 - 200
  • [5] Covering intervals with arithmetic progressions
    Balister, P.
    Bollobas, B.
    Morris, R.
    Sahasrabudhe, J.
    Tiba, M.
    [J]. ACTA MATHEMATICA HUNGARICA, 2020, 161 (01) : 197 - 200
  • [6] COVERING THE INTEGERS WITH ARITHMETIC PROGRESSIONS
    SIMPSON, RJ
    [J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 1985, 32 (03) : 461 - 463
  • [7] Hashiwokakero is NP-complete
    Andersson, Daniel
    [J]. INFORMATION PROCESSING LETTERS, 2009, 109 (19) : 1145 - 1146
  • [8] Minesweeper is NP-complete
    Richard Kaye
    [J]. The Mathematical Intelligencer, 2000, 22 : 9 - 15
  • [9] Shellability is NP-complete
    Goaoc, Xavier
    Patak, Pavel
    Patakova, Zuzana
    Tancer, Martin
    Wagner, Uli
    [J]. JOURNAL OF THE ACM, 2019, 66 (03)
  • [10] Rikudo is NP-complete
    Viet-Ha Nguyen
    Perrot, Kevin
    [J]. THEORETICAL COMPUTER SCIENCE, 2022, 910 : 34 - 47
12345