Pages that link to "Item:Q3395047"
From MaRDI portal
The following pages link to A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits (Q3395047):
Displaying 20 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)
- 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)
- Recent Results on Polynomial Identity Testing (Q3007643) (← 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)
- Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications (Q4646460) (← links)
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
- Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits (Q5091231) (← links)
- Towards Optimal Depth Reductions for Syntactically Multilinear Circuits (Q5091237) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5121899) (← links)
- (Q5121901) (← links)
- Non-commutative circuits and the sum-of-squares problem (Q5892594) (← links)