On derandomizing tests for certain polynomial identities (2003)
by
Manindra Agrawal
| Venue: | In Proceedings of the Conference on Computational Complexity |
| Citations: | 4 - 2 self |
BibTeX
@INPROCEEDINGS{Agrawal03onderandomizing,
author = {Manindra Agrawal},
title = {On derandomizing tests for certain polynomial identities},
booktitle = {In Proceedings of the Conference on Computational Complexity},
year = {2003},
pages = {355--362}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1
Citations
| 250 | Hardness vs. Randomness - Nisan, Wigderson - 1988 |
| 38 | On determinants, matchings and random algorithms - Lovász |
| 24 | Primality and identity testing via Chinese remaindering - Agrawal, Biswas |
| 4 | Derandomizing polyonmial identity test means proving circuit lower bounds - Kabanets, Impagliazzo - 2002 |
| 3 | Primality Testing with Gaussian Periods, preliminary version July 20 - Lenstra, Pomerance - 2005 |
