Pages that link to "Item:Q5899508"
From MaRDI portal
The following pages link to Multi-linear formulas for permanent and determinant are of super-polynomial size (Q5899508):
Displayed 35 items.
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Lower bounds for the determinantal complexity of explicit low degree polynomials (Q639850) (← links)
- Algebraic proofs over noncommutative formulas (Q642520) (← links)
- Sums of read-once formulas: how many summands are necessary? (Q1686070) (← links)
- Multi-\(k\)-ic depth three circuit lower bound (Q1694000) (← links)
- On the complexity of the permanent in various computational models (Q2013543) (← links)
- Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
- On the hardness of the determinant: sum of regular set-multilinear circuits (Q2140523) (← 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)
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403) (← 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)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree (Q4612480) (← links)
- (Q4612482) (← links)
- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models (Q4988917) (← links)
- Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
- (Q5028363) (← links)
- Towards Optimal Depth Reductions for Syntactically Multilinear Circuits (Q5091237) (← links)
- (Q5092414) (← links)
- On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5111256) (← links)
- (Q5121899) (← links)
- (Q5232538) (← links)
- Approaching the Chasm at Depth Four (Q5501936) (← links)
- Sums of Read-Once Formulas: How Many Summands Suffice? (Q5740191) (← links)
- Lower bounds for special cases of syntactic multilinear ABPs (Q5919345) (← links)