= Manindra Agrawal
{c}
<Manindra Agrawal> coauthored <Primality and Identity Testing via Chinese Remaindering by Manindra Agrawal and Somenath Biswas> with <Somenath Biswas> in 2003. The paper connects <primality testing> to <polynomial identity testing>, using <randomized algorithms> for circuit-represented <polynomials> over <finite fields>, the <rationals> and, for one procedure, <integers> modulo an arbitrary candidate.<Primality and Identity Testing via Chinese Remaindering by Manindra Agrawal and Somenath Biswas>[abstract]{ref}
The <computational problem> is not simply evaluating an already expanded <polynomial>: a compact <arithmetic circuit> may encode exponentially many <polynomial coefficients>. A successful test must exploit that representation without materializing the expansion. This distinction connects an algebraic identity to an implementable <randomized algorithm>.
Back to article page
