The following pages link to lowerbounds-survey (Q46322):
Displaying 27 items.
- (Q50316) (redirect page) (← links)
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
- Geometric complexity theory and matrix powering (Q1679673) (← links)
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials (Q1686837) (← links)
- Tensor rank is not multiplicative under the tensor product (Q1698592) (← links)
- On the linear independence of shifted powers (Q1704606) (← links)
- Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q2051373) (← links)
- A lower bound on determinantal complexity (Q2087768) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
- A note on VNP-completeness and border complexity (Q2122788) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- Depth-4 lower bounds, determinantal complexity: a unified approach (Q2281250) (← links)
- Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree (Q2294435) (← links)
- A quadratic lower bound for homogeneous algebraic branching programs (Q2323359) (← links)
- On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions (Q3295878) (← links)
- Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. (Q3304115) (← links)
- The Computational Power of Depth Five Arithmetic Circuits (Q4629389) (← links)
- Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications (Q4646460) (← links)
- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models (Q4988917) (← links)
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
- Towards blackbox identity testing of log-variate circuits (Q5002729) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q5121899) (← links)
- Hardness vs randomness for bounded depth arithmetic circuits (Q5121901) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)
- Lower bounds for special cases of syntactic multilinear ABPs (Q5919345) (← links)
