Some lower bound results for set-multilinear arithmetic computations
DOI10.4086/CJTCS.2016.006zbMATH Open1358.68109arXiv1511.02308OpenAlexW4250280356MaRDI QIDQ2808533FDOQ2808533
Publication date: 24 May 2016
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.02308
Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Determinants, permanents, traces, other special matrix functions (15A15)
Cites Work
Cited In (9)
- Title not available (Why is that?)
- Limitations of sums of bounded read formulas and ABPs
- Title not available (Why is that?)
- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models
- On the hardness of the determinant: sum of regular set-multilinear circuits
- Title not available (Why is that?)
- Lower bounds for arithmetic circuits via the Hankel matrix
- Lower bounds for the sum of small-size algebraic branching programs
- Lower bounds for special cases of syntactic multilinear ABPs
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 👍 👎
- Title not available (Why is that?) 👍 👎
- Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication 👍 👎
- A Selection of Lower Bounds for Arithmetic Circuits 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Lower bounds in algebraic computational complexity 👍 👎
- Lower bounds on the depth of monotone arithmetic computations 👍 👎
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)
