Search results
Arithmetic circuits: A chasm at depth four. M Agrawal, V Vinay. 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 67-75. , 2008. 270. 2008. Primality and identity testing via Chinese remaindering. M Agrawal, S Biswas. Journal of the ACM (JACM) 50 (4), 429-443.
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. CoRR abs/1111.0582 ( 2011 )
Manindra Agrawal Somenath Biswas Gives a simple and new primality testing algorithm by reducing primality testing for a number n to testing if a specific univariate identity over Z<sub>n</sub> holds.
The AKS primality test (also known as Agrawal–Kayal–Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002, in an article titled "PRIMES is in P ...
May 28, 2021 · Save & read from anywhere! Professor Manindra Agrawal of IIT-K explains his SUTRA model that charts the spread of Covid-19 in each state. Manindra Agrawal is a Professor of Computer Science at the ...
Manindra Agrawal is a theoretical computer scientist recognized for his work on computational number theory and algebra. He is known particularly for his design of a deterministic polynomial time algorithm for testing if a number is prime. Agrawal was born in Allahabad, UP (India) in 1966. He did his BTech and PhD, both in computer science ...
