Noncommutativity Makes Determinants Hard
From MaRDI portal
Publication:5326559
DOI10.1007/978-3-642-39206-1_15zbMath1328.68083OpenAlexW2216524230MaRDI QIDQ5326559
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
Analysis of algorithms and problem complexity (68Q25) Determinants, permanents, traces, other special matrix functions (15A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
On Hard Instances of Non-Commutative Permanent ⋮ On hard instances of non-commutative permanent ⋮ Algebraic Complexity Classes
This page was built for publication: Noncommutativity Makes Determinants Hard
