|
|
ru.algorithms- RU.ALGORITHMS ---------------------------------------------------------------- From : Max Alekseyev 2:5015/60 07 Aug 2002 18:06:12 To : All Subject : a polynomial time deterministic primality test --------------------------------------------------------------------------------
======================================================
* Original in area RU.CRYPT
* From: Sergii Laskavyi <ls@gambit.com.ru> 08/07/2002 06:31:21pm
* To : All
* Subj: a polynomial time O(log^6 n) deterministic algorithm to test if an input
number is prime or not
======================================================
http://www.cse.iitk.ac.in/news/primality.html
PRIMES is in P
[1]Prof. Manindra Agarwal and two of his students, [2]Nitin Saxena and
[3]Neeraj Kayal (both BTech from CSE/IITK who have just joined as
Ph.D. students), have discovered a polynomial time deterministic
algorithm to test if an input number is prime or not. Lots of people
over (literally!) 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
70s.
One of the main features of this result is that the proof is neither
too complex nor too long (their preprint paper is only 9 pages long!),
and relies on very innovative and insightful use of results from
number theory.
Download full paper ([4]PDF, [5]Postscript)
[6]CSE main page
[7]Feeback: webmaster@cse.iitk.ac.in
--
1. http://www.cse.iitk.ac.in/cgi-bin/faculty.cgi?manindra
2. mailto:nitins@cse.iitk.ac.in
3. mailto:kayaln@cse.iitk.ac.in
4. http://www.cse.iitk.ac.in/news/primality.pdf
5. http://www.cse.iitk.ac.in/news/primality.ps
6. http://www.cse.iitk.ac.in/
7. mailto:webmaster@cse.iitk.ac.in
==================== End of Forward ====================
Regards, ш.ш
Max ~
--- FleetStreet 1.27.3.8
* Origin: (2:5015/60)
Вернуться к списку тем, сортированных по: возрастание даты уменьшение даты тема автор
Архивное /ru.algorithms/18133d516194.html, оценка из 5, голосов 10
|