|
PRIMES is in P

Library Home ||
Full Table of Contents ||
Suggest a Link ||
Library Help

| http://www.cse.iitk.ac.in/news/primality.html | |
|
|
|
| Agarwal, Saxena, Kayal | |
| Prof. Manindra Agarwal and two of his students, Nitin Saxena and Neeraj Kayal, have discovered a polynomial time deterministic algorithm to test whether an input number is prime. Lots of people over centuries have been looking for a polynomial time test for primality, and this result is a major breakthrough, likened by some to the P-time solution to Linear Programming announced in the 1970s. | |
|
|
|
| Levels: | College, Research |
| Languages: | English |
| Resource Types: | Articles |
| Math Topics: | Prime Numbers |
[Privacy Policy] [Terms of Use]


© 1994-2008 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel School of Education.