12 search results - page 1 / 3 » More on Noncommutative Polynomial Identity Testing |
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...
COCO
2004
Springer
13 years 10 months ago
2004
Springer
We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases:
COCO
2008
Springer
13 years 7 months ago
2008
Springer
STACS
2009
Springer
14 years 1 days ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...