The following pages link to (Q3002768):
Displaying 31 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)
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913) (← links)
- Algebraic proofs over noncommutative formulas (Q642520) (← links)
- \textsf{VNP} = \textsf{VP} in the multilinear world (Q894473) (← links)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- Limitations of sums of bounded read formulas and ABPs (Q2117084) (← 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)
- Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree (Q2294435) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Algebraic Complexity Classes (Q2821695) (← 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)
- Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. (Q3304115) (← links)
- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs (Q3599145) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- (Q4612482) (← 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)
- (Q5028363) (← links)
- A quadratic lower bound for algebraic branching programs (Q5092449) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5121899) (← links)
- (Q5121901) (← links)
- Lower bounds for special cases of syntactic multilinear ABPs (Q5919345) (← links)
- Notes on Boolean read-\(k\) and multilinear circuits (Q6648273) (← links)
