Pages that link to "Item:Q1377574"
From MaRDI portal
The following pages link to Lower bounds on arithmetic circuits via partial derivatives (Q1377574):
Displaying 50 items.
- Lower bounds for depth-three arithmetic circuits with small bottom fanin (Q301527) (← links)
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913) (← links)
- Lower bounds for the determinantal complexity of explicit low degree polynomials (Q639850) (← links)
- Homogeneous formulas and symmetric polynomials (Q649096) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Multi-\(k\)-ic depth three circuit lower bound (Q1694000) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- Lower bounds for arithmetic circuits via the Hankel matrix (Q2051372) (← links)
- Polystability in positive characteristic and degree lower bounds for invariant rings (Q2102173) (← links)
- Improved bounds on the an-complexity of \(O(1)\)-linear functions (Q2159467) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
- A note on parameterized polynomial identity testing using hitting set generators (Q2274524) (← links)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
- Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree (Q2294435) (← links)
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
- Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Interval conjectures for level Hilbert functions (Q2390481) (← links)
- On the limits of depth reduction at depth 3 over small finite fields (Q2407087) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403) (← links)
- On the Expressive Power of Read-Once Determinants (Q2947872) (← links)
- Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication (Q2949210) (← links)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
- Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. (Q3304115) (← links)
- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials (Q3392951) (← links)
- Partial derivatives of a generic subspace of a vector space of forms: Quotients of level algebras of arbitrary type (Q3425952) (← links)
- Formulas versus Circuits for Small Distance Connectivity (Q4554075) (← links)
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree (Q4612480) (← links)
- (Q4612482) (← links)
- The Computational Power of Depth Five Arithmetic Circuits (Q4629389) (← links)
- The method of shifted partial derivatives cannot separate the permanent from the determinant (Q4637587) (← links)
- Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications (Q4646460) (← links)
- Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
- (Q5028363) (← links)
- (Q5089246) (← links)
- On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
- A quadratic lower bound for algebraic branching programs (Q5092449) (← links)
- (Q5092463) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)
- (Q5111256) (← links)
- (Q5121899) (← links)
