Some lower bound results for set-multilinear arithmetic computations
From MaRDI portal
Publication:2808533
Recommendations
- A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits
- scientific article; zbMATH DE number 7250151
- Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication
- A Selection of Lower Bounds for Arithmetic Circuits
- scientific article; zbMATH DE number 806753
- scientific article; zbMATH DE number 1351079
- Publication:4886070
- Lower bounds in algebraic computational complexity
- Lower bounds on the depth of monotone arithmetic computations
Cited in
(11)- On the hardness of the determinant: sum of regular set-multilinear circuits
- Limitations of sums of bounded read formulas and ABPs
- scientific article; zbMATH DE number 7561311 (Why is no real title available?)
- Lower bounds for arithmetic circuits via the Hankel matrix
- On proving parameterized size lower bounds for multilinear algebraic models
- On proving parameterized size lower bounds for multilinear algebraic models
- scientific article; zbMATH DE number 7561696 (Why is no real title available?)
- Lower bounds for special cases of syntactic multilinear ABPs
- scientific article; zbMATH DE number 7204372 (Why is no real title available?)
- Lower bounds for the sum of small-size algebraic branching programs
- Lower bounds for special cases of syntactic multilinear ABPs
This page was built for publication: Some lower bound results for set-multilinear arithmetic computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808533)