DMCA
Classifying polynomials and identity testing (2009)
| Citations: | 8 - 1 self |
BibTeX
@TECHREPORT{Agrawal09classifyingpolynomials,
author = {Manindra Agrawal and Ramprasad Saptharishi},
title = {Classifying polynomials and identity testing},
institution = {},
year = {2009}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
e-mail: One of the fundamental problems of computational algebra is to classify polynomials according to the hardness of computing them. Recently, this problem has been related to another important problem: Polynomial identity testing. Informally, the problem is to decide if a certain succinct representation of a polynomial is zero or not. This problem has been extensively studied owing to its connections with various areas in theoretical computer science. Several efficient randomized algorithms have been proposed for the identity testing problem over the last few decades but an efficient deterministic algorithm is yet to be discovered. It is known that such an algorithm will imply hardness of computing an explicit polynomial. In the last few years, progress has been made in designing deterministic algorithms for restricted circuits, and also in understanding why the problem is hard even for small depth. In this article, we survey important results for the polynomial identity testing problem and its connection with classification of polynomials. 1.
Keyphrases
identity testing polynomial identity efficient deterministic algorithm deterministic algorithm survey important result various area computational algebra important problem last decade certain succinct representation small depth fundamental problem restricted circuit last year explicit polynomial theoretical computer science
