On Derandomizing Tests for Certain Polynomial Identities

13 years 9 months ago

Download www.cse.iitk.ac.in

We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.

Manindra Agrawal

Real-time Traffic

COCO 2003 | Polynomial Identities | Testing Algorithm |

claim paper

» Derandomizing Polynomial Identity Testing for Multilinear ConstantRead Formulae

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

» Checking Polynomial Identities over any Field Towards a Derandomization

» Arithmetic circuits the chasm at depth four gets wider

» A note on circuit lower bounds from derandomization

» Shallow Circuits with HighPowered Inputs

» More on Noncommutative Polynomial Identity Testing

» The Proof Complexity of Polynomial Identities

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	COCO
Authors	Manindra Agrawal

Comments (0)

Sciweavers

On Derandomizing Tests for Certain Polynomial Identities

COCO 2003 | Polynomial Identities | Testing Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers