scientific article; zbMATH DE number 7758331
From MaRDI portal
Publication:6062153
DOI10.4230/lipics.approx/random.2020.29arXiv1804.09124MaRDI QIDQ6062153
Mrinal Kumar, Prahladh Harsha, Swastik Kopparty, Pooya Hatami, Abhishek Bhrushundi
Publication date: 31 October 2023
Full work available at URL: https://arxiv.org/abs/1804.09124
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Random low-degree polynomials are hard to approximate
- Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Hardness vs randomness
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- Affine Dispersers from Subspace Polynomials
- Tensor rank is NP-complete
- On the Power of Small-Depth Computation
- An Improved Lower Bound on Polynomial Multiplication
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Lower Bounds for Matrix Product
- Barriers for Rank Methods in Arithmetic Complexity
- The analytic rank of tensors and its applications
- A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields
- Tensor-Rank and Lower Bounds for Arithmetic Formulas
- Algebraic complexities and algebraic curves over finite fields
This page was built for publication:
