522 search results - page 1 / 105 » On the Hardness of the Noncommutative Determinant |
STOC
2010
ACM
14 years 2 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...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
STACS
1999
Springer
13 years 9 months ago
1999
Springer
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...