The following pages link to Amir Shpilka (Q232998):
Displaying 50 items.
- Direct sum fails for zero-error average communication (Q343859) (← links)
- On sunflowers and matrix multiplication (Q354642) (← links)
- Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields (Q395606) (← links)
- On the minimal Fourier degree of symmetric Boolean functions (Q397079) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. (Q519967) (← links)
- The black-box query complexity of polynomial summation (Q626615) (← links)
- Constructions of low-degree and error-correcting \(\varepsilon \)-biased generators (Q626671) (← links)
- The complexity of Boolean functions in different characteristics (Q626677) (← links)
- Towards dimension expanders over finite fields (Q654002) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Deterministic polynomial identity testing in non-commutative models (Q1781113) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- An improved analysis of linear mergers (Q2472428) (← links)
- Optimal Testing of Multivariate Polynomials over Small Prime Fields (Q2840981) (← links)
- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing (Q2851883) (← links)
- On the structure of cubic and quartic polynomials (Q2875161) (← links)
- Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in (Q2875192) (← links)
- Explicit Dimension Reduction and Its Applications (Q2884581) (← links)
- Capacity Achieving Two-Write WOM Codes (Q2894504) (← links)
- Reed-Muller Codes for Random Erasures and Errors (Q2941518) (← links)
- Reed–Muller Codes for Random Erasures and Errors (Q2977204) (← links)
- High Sum-Rate Three-Write and Nonbinary WOM Codes (Q2983342) (← links)
- Capacity-Achieving Multiwrite WOM Codes (Q2986471) (← links)
- Direct sum fails for zero error average communication (Q2988905) (← links)
- (Q3002772) (← links)
- (Q3002826) (← links)
- Recent Results on Polynomial Identity Testing (Q3007643) (← links)
- Arithmetic Circuits: A survey of recent results and open questions (Q3069052) (← links)
- On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
- A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits (Q3395047) (← links)
- Locally Testable Cyclic Codes (Q3546520) (← links)
- (Q3549624) (← links)
- Derandomizing homomorphism testing in general groups (Q3580987) (← links)
- Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits (Q3581452) (← links)
- Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits (Q3586180) (← links)
- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors (Q3587395) (← links)
- Improved Polynomial Identity Testing for Read-Once Formulas (Q3638914) (← links)
- Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates (Q3654372) (← links)
- Lower Bounds for Matrix Product (Q4429681) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- (Q4612482) (← links)
- Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates (Q4706215) (← links)
- Succinct hitting sets and barriers to proving algebraic circuits lower bounds (Q4978011) (← links)
- Reed–Muller Codes: Theory and Algorithms (Q5001713) (← links)
- (Q5028363) (← links)
- Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions (Q5048295) (← links)
