The following pages link to Shachar Lovett (Q251731):
Displaying 50 items.
- Equivalence of polynomial conjectures in additive combinatorics (Q377805) (← links)
- Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields (Q395606) (← links)
- Nontrivial \(t\)-designs over finite fields exist for all \(t\) (Q406567) (← links)
- Random low-degree polynomials are hard to approximate (Q430841) (← links)
- Variety evasive sets (Q475333) (← links)
- On the structure of the spectrum of small sets (Q507818) (← links)
- The complexity of Boolean functions in different characteristics (Q626677) (← links)
- Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms (Q657865) (← links)
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- On the impossibility of entropy reversal, and its application to zero-knowledge proofs (Q1690186) (← links)
- Improved bounds for the sunflower lemma (Q2058613) (← links)
- Probabilistic existence of large sets of designs (Q2194761) (← links)
- Probabilistic existence of regular combinatorial structures (Q2400828) (← links)
- The Freiman-Ruzsa theorem over finite fields (Q2451906) (← links)
- Inverse Conjecture for the Gowers norm is false (Q2913795) (← links)
- (Q2913800) (← links)
- Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime (Q2929703) (← links)
- Improved Noisy Population Recovery, and Reverse Bonami-Beckner Inequality for Sparse Functions (Q2941497) (← links)
- The List Decoding Radius of Reed-Muller Codes over Small Fields (Q2941515) (← links)
- (Q3002801) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions (Q3167409) (← links)
- Communication is Bounded by Root of Rank (Q3177758) (← links)
- (Q3191585) (← links)
- A tail bound for read-<i>k</i>families of functions (Q3192374) (← links)
- Constructive Discrepancy Minimization by Walking on the Edges (Q3449569) (← links)
- Group representations that resist random sampling (Q3452732) (← links)
- ALMOST EUCLIDEAN SECTIONS OF THE N-DIMENSIONAL CROSS-POLYTOPE USING O(N) RANDOM BITS (Q3526528) (← links)
- Random Low Degree Polynomials are Hard to Approximate (Q3638891) (← links)
- Pseudorandom Bit Generators That Fool Modular Sums (Q3638908) (← links)
- Algebraic Attacks against Random Local Functions and Their Countermeasures (Q4600698) (← links)
- (Q4601823) (← links)
- Structure of Protocols for XOR Functions (Q4605274) (← links)
- (Q4608008) (← links)
- Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem (Q4636461) (← links)
- On the Beck-Fiala Conjecture for Random Set Systems (Q4636462) (← links)
- Non-Malleable Codes from Additive Combinatorics (Q4637777) (← links)
- A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space (Q4645013) (← links)
- LOWER BOUNDS FOR ADAPTIVE LINEARITY TESTS (Q4910747) (← links)
- Recent advances on the log-rank conjecture in communication complexity (Q4967160) (← links)
- (Q5002761) (← links)
- (Q5009548) (← links)
- Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture (Q5009787) (← links)
- (Q5028366) (← links)
- Decision List Compression by Mild Random Restrictions (Q5056434) (← links)
- (Q5090385) (← links)
- Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates (Q5090395) (← links)
- (Q5091755) (← links)
- Optimality of linear sketching under modular updates (Q5091764) (← links)
- Equality alone does not simulate randomness (Q5091765) (← links)
