Upper tail estimates with combinatorial proofs

被引：0
|
作者：
ETH Zürich, Department of Computer Science, Zurich, Switzerland [1 ]
机构：
来源：
Leibniz Int. Proc. Informatics, LIPIcs | / 392-405期
关键词：
Engineering Village;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Chernoff bounds - Combinatorial proof - Concentration bounds - Input variables - One-way functions - Polynomial concentration - Pseudorandom generators - Random Walk
引用
收藏
相关论文
共 50 条
  • [1] Upper Tail Estimates with Combinatorial Proofs
    Hazla, Jan
    Holenstein, Thomas
    32ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2015), 2015, 30 : 392 - 405
  • [2] The Deletion Method For Upper Tail Estimates
    Svante Janson
    Andrzej Ruciński*
    Combinatorica, 2004, 24 : 615 - 640
  • [3] The deletion method for upper tail estimates
    Janson, S
    Rucinski, A
    COMBINATORICA, 2004, 24 (04) : 615 - 640
  • [4] On the missing log in upper tail estimates
    Warnke, Lutz
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2020, 140 : 98 - 146
  • [5] Combinatorial Proofs and Algebraic Proofs - I
    Shirali, Shailesh A.
    RESONANCE-JOURNAL OF SCIENCE EDUCATION, 2013, 18 (07): : 630 - 645
  • [6] Combinatorial Proofs and Algebraic Proofs - II
    Shirali, Shailesh A.
    RESONANCE-JOURNAL OF SCIENCE EDUCATION, 2013, 18 (08): : 738 - 747
  • [7] From Syntactic Proofs to Combinatorial Proofs
    Acclavio, Matteo
    Strassburger, Lutz
    AUTOMATED REASONING, IJCAR 2018, 2018, 10900 : 481 - 497
  • [8] Combinatorial PCPs with Short Proofs
    Meir, Or
    COMPUTATIONAL COMPLEXITY, 2016, 25 (01) : 1 - 102
  • [9] Combinatorial PCPs with Short Proofs
    Meir, Or
    2012 IEEE 27TH ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2012, : 345 - 355
  • [10] COMBINATORIAL PROOFS OF FIBONOMIAL IDENTITIES
    Benjamin, Arthur T.
    Reiland, Elizabeth
    FIBONACCI QUARTERLY, 2014, 52 (05): : 28 - 34
12345