On sparse sets hitting linear forms

被引:0
|
作者
Chung, F [1 ]
Erdös, P [1 ]
Graham, R [1 ]
机构
[1] Univ San Diego, Dept Math, San Diego, CA 92110 USA
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:257 / 272
页数:16
相关论文
共 50 条
  • [31] Dynamic Kernels for Hitting Sets and Set Packing
    Max Bannach
    Zacharias Heinrich
    Rüdiger Reischuk
    Till Tantau
    Algorithmica, 2022, 84 : 3459 - 3488
  • [32] Optimal drug combinations and minimal hitting sets
    Vazquez, Alexei
    BMC SYSTEMS BIOLOGY, 2009, 3
  • [33] FPT Algorithms for Diverse Collections of Hitting Sets
    Baste, Julien
    Jaffke, Lars
    Masarik, Tomas
    Philip, Geevarghese
    Rote, Guenter
    ALGORITHMS, 2019, 12 (12)
  • [34] Sumsets of dense sets and sparse sets
    Griesmer, John T.
    ISRAEL JOURNAL OF MATHEMATICS, 2012, 190 (01) : 229 - 252
  • [35] Sumsets of dense sets and sparse sets
    John T. Griesmer
    Israel Journal of Mathematics, 2012, 190 : 229 - 252
  • [36] Intersective sets for sparse sets of integers
    Bienvenu, Pierre-Yves
    Griesmer, John T.
    Le, Anh N.
    Le, Thai Hoang
    ERGODIC THEORY AND DYNAMICAL SYSTEMS, 2025, 45 (05) : 1370 - 1402
  • [37] Connecting face hitting sets in planar graphs
    Schweitzer, Pascal
    Schweitzer, Patrick
    INFORMATION PROCESSING LETTERS, 2010, 111 (01) : 11 - 15
  • [38] Minimal approximate hitting sets and rule templates
    Vinterbo, S
    Ohrn, A
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2000, 25 (02) : 123 - 143
  • [39] ON REDUCTIONS OF NP SETS TO SPARSE SETS
    HOMER, S
    LONGPRE, L
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 48 (02) : 324 - 336
  • [40] Strengthening Landmark Heuristics via Hitting Sets
    Bonet, Blai
    Helmert, Malte
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 329 - 334