Noncommutativity makes determinants hard

DOI10.1007/978-3-642-39206-1_15MaRDI QIDQ5326559zbMATH OpenOpenAlexFDO

Authors Markus Bläser

Publication date 6 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39206-1_15

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Noncommutativity makes determinants hard
• Almost settling the hardness of noncommutative determinant
• Algebras with Polynomial Identities and Computing the Determinant
• On the hardness of the noncommutative determinant
• On the hardness of the noncommutative determinant

Cited in

(8)

• On hard instances of non-commutative permanent
• Noncommutativity makes determinants hard
• On hard instances of non-commutative permanent
• Algebraic complexity classes
• Almost settling the hardness of noncommutative determinant
• Algebras with Polynomial Identities and Computing the Determinant
• On the hardness of the noncommutative determinant
• On the hardness of the noncommutative determinant

This page was built for publication: Noncommutativity makes determinants hard

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