Pages that link to "Item:Q5957088"
From MaRDI portal
The following pages link to Depth-3 arithmetic circuits over fields of characteristic zero (Q5957088):
Displaying 32 items.
- Lower bounds for depth-three arithmetic circuits with small bottom fanin (Q301527) (← 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)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- Monotone separations for constant degree polynomials (Q990088) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
- Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← 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)
- On the limits of depth reduction at depth 3 over small finite fields (Q2407087) (← links)
- Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- Types of depth and formula size (Q2920906) (← 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)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials (Q3392951) (← links)
- The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In (Q3451754) (← links)
- (Q5028363) (← links)
- (Q5092463) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5111256) (← links)
- Approaching the Chasm at Depth Four (Q5501936) (← links)
- Schur polynomials do not have small formulas if the determinant does not (Q6113104) (← links)
