11 search results - page 3 / 3 » A sparse modular GCD algorithm for polynomials over algebrai... |
STOC
2010
ACM
14 years 3 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...