Title :
On derandomizing tests for certain polynomial identities
Author :
Agrawal, Manindra
Author_Institution :
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kanpur, India
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.
Keywords :
computational complexity; number theory; polynomials; randomised algorithms; AKS primality testing algorithm; derandomization test; polynomial identity testing; prime number characterization; randomized algorithm; Arithmetic; Artificial intelligence; Bipartite graph; Character generation; Circuit testing; Computational complexity; Equations; Polynomials;
Conference_Titel :
Computational Complexity, 2003. Proceedings. 18th IEEE Annual Conference on
Print_ISBN :
0-7695-1879-6
DOI :
10.1109/CCC.2003.1214434
