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
来源：
NUMBER THEORY FOR THE MILLENNIUM I | 2002年
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：257 / 272
页数：16
相关论文
共 50 条
  • [41] Dynamic Kernels for Hitting Sets and Set Packing
    Bannach, Max
    Heinrich, Zacharias
    Reischuk, Ruediger
    Tantau, Till
    ALGORITHMICA, 2022, 84 (11) : 3459 - 3488
  • [42] Asymptotically optimal hitting sets against polynomials
    Blaeser, Markus
    Hardt, Moritz
    Steurer, David
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, PROCEEDINGS, 2008, 5125 : 345 - +
  • [43] A NOTE ON THE HITTING PROBABILITIES OF RANDOM COVERING SETS
    Li, Bing
    Suomala, Ville
    ANNALES ACADEMIAE SCIENTIARUM FENNICAE-MATHEMATICA, 2014, 39 (02) : 625 - 633
  • [44] FPT algorithms for diverse collections of hitting sets
    Baste J.
    Jaffke L.
    Masařík T.
    Philip G.
    Rote G.
    Algorithms, 2019, 12 (02)
  • [45] Mixing Times are Hitting Times of Large Sets
    Yuval Peres
    Perla Sousi
    Journal of Theoretical Probability, 2015, 28 : 488 - 519
  • [46] HITTING TIMES OF DECREASING SETS FOR REGENERATIVE PROCESSES
    ATHREYA, KB
    JOURNAL OF APPLIED PROBABILITY, 1988, 25 (01) : 89 - 96
  • [47] Geometric Hitting Sets for Disks: Theory and Practice
    Busl, Norbert
    Mustafal, Nabil H.
    Ray, Saurabh
    ALGORITHMS - ESA 2015, 2015, 9294 : 903 - 914
  • [48] Dimension estimates for sets of uniformly badly approximable systems of linear forms
    Broderick, Ryan
    Kleinbock, Dmitry
    INTERNATIONAL JOURNAL OF NUMBER THEORY, 2015, 11 (07) : 2037 - 2054
  • [49] SIDON SETS AND TRANSLATION-INVARIANT LINEAR FORMS - PRELIMINARY REPORT
    MEISTERS, GH
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (05): : A492 - A492
  • [50] SOLVING SPARSE SYMMETRIC SETS OF LINEAR-EQUATIONS BY PRECONDITIONED CONJUGATE GRADIENTS
    MUNKSGAARD, N
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (02): : 206 - 219
12345