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 条
  • [1] Efficient constructions of Hitting sets for systems of linear functions
    Andreev, AE
    Clementi, AEF
    Rolim, JDP
    STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 387 - 398
  • [2] LinearMerge: Efficient computation of minimal hitting sets for conflict sets in a linear structure
    Zhao, Xiangfu
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2018, 72 : 327 - 339
  • [3] Sidon sets for linear forms
    Nathanson, Melvyn B.
    JOURNAL OF NUMBER THEORY, 2022, 239 : 207 - 227
  • [4] Near-Linear Approximation Algorithms for Geometric Hitting Sets
    Agarwal, Pankaj K.
    Ezra, Esther
    Sharir, Micha
    PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SCG'09), 2009, : 23 - 32
  • [5] Near-Linear Approximation Algorithms for Geometric Hitting Sets
    Agarwal, Pankaj K.
    Ezra, Esther
    Sharir, Micha
    ALGORITHMICA, 2012, 63 (1-2) : 1 - 25
  • [6] Near-Linear Approximation Algorithms for Geometric Hitting Sets
    Pankaj K. Agarwal
    Esther Ezra
    Micha Sharir
    Algorithmica, 2012, 63 : 1 - 25
  • [7] Linear forms in finite sets of integers
    Han, SP
    Kirfel, C
    Nathanson, MB
    RAMANUJAN JOURNAL, 1998, 2 (1-2): : 271 - 281
  • [8] Linear Forms in Finite Sets of Integers
    Shu-Ping Han
    Christoph Kirfel
    Melvyn B. Nathanson
    The Ramanujan Journal, 1998, 2 : 271 - 281
  • [9] On sets of linear forms of maximal complexity
    Kaminski, Michael
    Shparlinski, Igor E.
    Waldschmidt, Michel
    COMPUTATIONAL COMPLEXITY, 2023, 32 (01)
  • [10] Greedy Sidon sets for linear forms
    Cheng, Yin Choi
    JOURNAL OF NUMBER THEORY, 2025, 266 : 225 - 248
12345