Noncommutativity Makes Determinants Hard

DOI10.1007/978-3-642-39206-1_15zbMath1328.68083MaRDI QIDQ5326559

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

68Q25: Analysis of algorithms and problem complexity

15A15: Determinants, permanents, traces, other special matrix functions

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