Almost settling the hardness of noncommutative determinant

DOI10.1145/1993636.1993703zbMath1288.68108arXiv1101.1169OpenAlexW3098063258MaRDI QIDQ5419120

Prahladh Harsha, Steve Chien, Alistair Sinclair, Srikanth Srinivasan

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.1169

zbMATH Keywords

determinantpermanentnoncommutative algebrascomputational algebra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Determinants, permanents, traces, other special matrix functions (15A15)

Related Items (3)

Undirected determinant and its complexity ⋮ On the hardness of the noncommutative determinant ⋮ Noncommutativity makes determinants hard

This page was built for publication: Almost settling the hardness of noncommutative determinant