Manindra Agrawal,
"On Derandomizing Tests for Certain Polynomial Identities,"
Computational Complexity, Annual IEEE Conference on, pp. 355, 18th Annual IEEE Conference on Computational Complexity (CCC'03), 2003.
BibTex
x
@article{
10.1109/CCC.2003.1214434, author = {Manindra Agrawal}, title = {On Derandomizing Tests for Certain Polynomial Identities}, journal ={Computational Complexity, Annual IEEE Conference on}, volume = {0}, year = {2003}, issn = {1093-0159}, pages = {355}, doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.2003.1214434}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }
RefWorks Procite/RefMan/Endnote
x
TY - CONF JO - Computational Complexity, Annual IEEE Conference on TI - On Derandomizing Tests for Certain Polynomial Identities SN - 1093-0159 SP EP A1 - Manindra Agrawal, PY - 2003 KW - null VL - 0 JA - Computational Complexity, Annual IEEE Conference on ER -
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.
Citation:
Manindra Agrawal, "On Derandomizing Tests for Certain Polynomial Identities," ccc, pp.355, 18th Annual IEEE Conference on Computational Complexity (CCC'03), 2003
PURCHASE ARTICLE: $19
IEEE Xplore Subscribers
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb