2016 · 71 citations · 40 references
ComputingComputer ScienceMathematicsAlgebraAlgorithmsTheory Of ComputationComputational AlgebraMatrix ComputationNon-deterministic Polynomial TimePolynomial Identity TestingPolynomial-time Algorithms
Symbolic matrices in non-commuting variables, andthe related structural and algorithmic questions, have a remarkablenumber of diverse origins and motivations. They ariseindependently in (commutative) invariant theory and representationtheory, linear algebra, optimization, linear system theory,quantum information theory, and naturally in non-commutativealgebra.
40
The complexity of computing the permanent
Leslie G. Valiant · Theoretical Computer Science · 1979 · 2.8K citations
The invariant theory of n × n matrices
Claudio Procesi · Advances in Mathematics · 1976 · 712 citations
Completeness classes in algebra
Leslie G. Valiant · 1979 · 487 citations · Full text