Pages that link to "Item:Q2816300"
From MaRDI portal
The following pages link to Arithmetic circuits: a chasm at depth 3 (Q2816300):
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)
- Arithmetic circuits: the chasm at depth four gets wider (Q442109) (← links)
- Lower bounds by Birkhoff interpolation (Q511113) (← links)
- Fundamental invariants of orbit closures (Q517074) (← links)
- Lower bounds and separations for constant depth multilinear circuits (Q626617) (← links)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
- On \(\varSigma\wedge\varSigma\wedge\varSigma\) circuits: the role of middle \(\varSigma\) fan-in, homogeneity and bottom degree (Q1679975) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Multi-\(k\)-ic depth three circuit lower bound (Q1694000) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- Permanent does not have succinct polynomial size arithmetic circuits of constant depth (Q1951581) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants (Q2272599) (← links)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
- A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
- Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
- Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← 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)
- Improved bounds for reduction to depth 4 and depth 3 (Q2514141) (← links)
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
- Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits (Q2817792) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- Arithmetic circuits and the Hadamard product of polynomials (Q2920110) (← links)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
- On the Power of Homogeneous Depth 4 Arithmetic Circuits (Q2968157) (← links)
- Elusive functions and lower bounds for arithmetic circuits (Q3002820) (← links)
- Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. (Q3304115) (← links)
- Lower Bounds for Sums of Powers of Low Degree Univariates (Q3448839) (← links)
- Equations for secant varieties of Chow varieties (Q4601326) (← 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)
- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models (Q4988917) (← links)
- Towards blackbox identity testing of log-variate circuits (Q5002729) (← links)
- (Q5028363) (← links)
- A quadratic lower bound for algebraic branching programs (Q5092449) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- (Q5092463) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5092488) (← links)
- (Q5121900) (← links)
- Hardness vs randomness for bounded depth arithmetic circuits (Q5121901) (← links)
