Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR09-101 | 20th October 2009 14:44

Progress on Polynomial Identity Testing

RSS-Feed




TR09-101
Authors: Nitin Saxena
Publication: 22nd October 2009 05:53
Downloads: 2293
Keywords: 


Abstract:

Polynomial identity testing (PIT) is the problem of checking whether a given
arithmetic circuit is the zero circuit. PIT ranks as one of the most important
open problems in the intersection of algebra and computational complexity. In the last
few years, there has been an impressive progress on this problem but a complete
solution might take a while. In this article we give a soft survey exhibiting the ideas
that have been useful.



ISSN 1433-8092 | Imprint