On the hardness of the noncommutative determinant
From MaRDI portal
Publication:5891430
DOI10.1145/1806689.1806782zbMath1293.68156OpenAlexW2064524663MaRDI QIDQ5891430
V. Arvind, Srikanth Srinivasan
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806782
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 (8)
Fast exact algorithms using Hadamard product of polynomials ⋮ On the hardness of the determinant: sum of regular set-multilinear circuits ⋮ On the hardness of the noncommutative determinant ⋮ Non-commutative circuits and the sum-of-squares problem ⋮ On Hard Instances of Non-Commutative Permanent ⋮ Unnamed Item ⋮ On hard instances of non-commutative permanent ⋮ Noncommutativity makes determinants hard
This page was built for publication: On the hardness of the noncommutative determinant
