12 search results - page 1 / 3 » New Results on Noncommutative and Commutative Polynomial Ide... |
COCO
2008
Springer
13 years 6 months ago
2008
Springer
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:
STACS
2009
Springer
13 years 11 months 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...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...