Communications of the ACM
India Prof Tips Fastest Prime Number Detection Algorithm
Professor Agrawal says that his deterministic polynomial time algorithm for detecting prime numbers "is faster than other existing solutions and is foolproof."
Credit: ClayMath.org
Manindra Agrawal, an Indian professor who developed a deterministic polynomial time algorithm for detecting prime numbers, will receive the 2009 G.D. Birla Award for Scientific Research. Agrawal, a professor at IIT Kanpur who also heads its department of computer science and engineering, has conducted pioneering research on theories of computation and algorithms. The award was created to honor significant achievements made by young Indian scientists, and comes with a cash prize.
The deterministic polynomial time algorithm enabled Agrawal to solve a problem that has stymied mathematicians for nearly 200 years. "It is faster than other existing solutions and is foolproof," Agrawal says.
From EE Times India
View Full Article
Abstracts Copyright © 2009 Information Inc., Bethesda, Maryland, USA 
No entries found