Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > LOCAL CENTRAL LIMIT THEOREM:
Reports tagged with Local Central Limit Theorem:
TR17-070 | 15th April 2017
Shachar Lovett, Sankeerth Rao Karingula, Alex Vardy

Probabilistic Existence of Large Sets of Designs

A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been introduced by Kuperberg, Lovett, and Peled (STOC 2012). Using this technique, it can be shown that under certain conditions, a randomly chosen structure has the required properties of a $t-(n,k,?)$ combinatorial design with tiny, yet ... more >>>




ISSN 1433-8092 | Imprint