On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains

DOI10.1007/978-3-319-06686-8_6zbMATH Open1407.68162OpenAlexW2182171633MaRDI QIDQ4981150

Author name not available (Why is that?)

Publication date: 24 June 2014

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06686-8_6

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits ⋮ Nonlinear lower bounds on the number of processors of circuits with sublinear separators ⋮ Non-commutative circuits and the sum-of-squares problem ⋮ Title not available (Why is that?) ⋮ Non-commutative arithmetic circuits: depth reduction and size lower bounds

This page was built for publication: On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4981150)