Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

COCO
2004
Springer

favoriteEmaildiscussreport

86views Algorithms» more COCO 2004»

Deterministic Polynomial Identity Testing in Non-Commutative Models

13 years 10 months ago

Deterministic Polynomial Identity Testing in Non-Commutative Models

Download www.cs.technion.ac.il

We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases:

Ran Raz, Amir Shpilka

Real-time Traffic

COCO 2004 | Deterministic Polynomial Time | Polynomial Identity Testing |

claim paper

Related Content

» A Case of Depth3 Identity Testing Sparse Factorization and Duality

» Deterministic identity testing for multivariate polynomials

» On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors

» Diagonal Circuit Identity Testing and Lower Bounds

» Deterministic Identity Testing of ReadOnce Algebraic Branching Programs

» Improved Polynomial Identity Testing for ReadOnce Formulas

» Polynomial Identity Testing for Depth 3 Circuits

» The Power of Depth 2 Circuits over Algebras

» More on Noncommutative Polynomial Identity Testing

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	COCO
Authors	Ran Raz, Amir Shpilka

Comments (0)