scientific article; zbMATH DE number 7378663
From MaRDI portal
Publication:5009548
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.51MaRDI QIDQ5009548
Shachar Lovett, Jiapeng Zhang, Xin Li
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Unnamed Item ⋮ Improved bounds for the sunflower lemma ⋮ Monotone circuit lower bounds from robust sunflowers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On sunflowers and matrix multiplication
- DNF sparsification and a faster deterministic counting algorithm
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- The primes contain arbitrarily long arithmetic progressions
- Intersection Theorems for Systems of Sets
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- On sets of integers containing k elements in arithmetic progression
- Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
- Explicit two-source extractors and resilient functions
- The Monotone Complexity of $k$-Clique on Random Graphs
- Some remarks on the theory of graphs
- Rectangles Are Nonnegative Juntas
- Simulating independence
This page was built for publication:
