On derandomizing tests for certain polynomial identities

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 355-359

  Agrawal, Manindra ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATRIX ALGEBRA; ARTIFICIAL INTELLIGENCE; DIGITAL ARITHMETIC;

DERANDOMIZING TESTS;

POLYNOMIALS;

BIPARTITE GRAPHS; CHARACTER GENERATION; CIRCUIT TESTING; DERANDOMIZING; EQUATIONS; POLYNOMIAL IDENTITIES; PRIMALITY TESTING;

EID: 0043016135     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. M. Agrawal and S. Biswas. Primality and identity testing via Chinese remaindering. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science, pages 202-209, 1999.
2. M. Agrawal, N. Kayal, and N. Saxena. PRIMES is in P. Preprint (http://www.cse.iitk.ac.in/news/primality_v3.ps), February 2003.
3. V. Kabanets and R. Impagliazzo. Derandomizing polyonmial identity test means proving circuit lower bounds, to appear in STOC 2003; TR02-055 (http://www.eccc.uni-trier.de/eccc-local/Lists/TR-2002.html), 2002.
4. H. W. Lenstra, Jr. and C. Pomerance. Primality testing with gaussian periods. Private communication, March 2003.
5. L. Lovasz. On determinants, matchings, and random algorithms. In L. Budach, editor, Fundamentals of Computing Theory. Akademia-Verlag, 1979.
6. N. Nisan and A. Wigderson. Hardness vs. randomness. J. Comput. Sys. Sci., 49(2):149-167, 1994.