CACM logo

ACM TechNews

India Prof Tips Fastest Prime Number Detection Algorithm

[article image]
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

Sign In To Comment On This Article

If you are an ACM member, Communications subscriber, Digital Library subscriber, or use your institution's subscription, please set up a web account to access comments, premium content and additional site features.

If you are a SIG member or member of the general public, you may set up a web account to comment on free articles and sign up for email alerts.

Tools For Readers

Bookmark and Share
Default Font Size Large Font Size X-Large Font Size Text Size

Related ACM Resources

Conferences:

Books:

Courses:


About Communications | Join ACM External Link | Renew External Link | Subscribe External Link | Sign In | For Authors | For Advertisers External Link | Privacy | Site Map | Help | Contact Us

Copyright © 2009 by the ACM. All rights reserved.