[Ilugc] HATS OFF IIT for raising India's image again...........

  • From: ssvel@xxxxxxxxxxxxx (ssvel)
  • Date: Sat, 10 Aug 2002 12:41:28 +0530

This is a multi-part message in MIME format.

------=_NextPart_000_0130_01C2406B.3F0A6780
Content-Type: text/plain;
        charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable


Look at the following web page with links to reports in the press and a
publicly
available draft now:

http://www.cse.iitk.ac.in/news/primality.html

Manindra Agrawal and two undergraduate students at the Indian =
Institute
of Technology, Kanpur have achieved everlasting fame  by resolving an
age old problem that goes back to Gauss' Disquisitiones: the problem =
of
primality testing. In a stunning result, they give a deterministic
polynomial time algorithm to test if a given number is prime or
composite. The proof is relatively simple and uses only elementary =
group
theory,  the algebra of polynomials over finite fields and some =
standard
estimates of the density of primes (remember that two of the authors =
are
undergrad CS students!).


Computer Science departments across the globe are holding seminars about
this, and report that the result is so simple they can hold these =
seminars
with little preparation.



------=_NextPart_000_0130_01C2406B.3F0A6780
Content-Type: text/html;
        charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content=3D"text/html; charset=3Diso-8859-1" =
http-equiv=3DContent-Type>
<META content=3D"MSHTML 5.00.2920.0" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV><FONT face=3DArial size=3D2><BR>Look at the following web page with =
links to=20
reports in the press and a<BR>publicly<BR>available draft now:<BR><BR><A =

href=3D"http://www.cse.iitk.ac.in/news/primality.html";>http://www.cse.iit=
k.ac.in/news/primality.html</A><BR><BR>&gt;=20
Manindra Agrawal and two undergraduate students at the Indian =
Institute<BR>&gt;=20
of Technology, Kanpur have achieved everlasting fame&nbsp; by resolving=20
an<BR>&gt; age old problem that goes back to Gauss' Disquisitiones: the =
problem=20
of<BR>&gt; primality testing. In a stunning result, they give a=20
deterministic<BR>&gt; polynomial time algorithm to test if a given =
number is=20
prime or<BR>&gt; composite. The proof is relatively simple and uses only =

elementary group<BR>&gt; theory,&nbsp; the algebra of polynomials over =
finite=20
fields and some standard<BR>&gt; estimates of the density of primes =
(remember=20
that two of the authors are<BR>&gt; undergrad CS=20
students!).<BR>&gt;<BR><BR>Computer Science departments across the globe =
are=20
holding seminars about<BR>this, and report that the result is so simple =
they can=20
hold these seminars<BR>with little=20
preparation.<BR><BR></FONT></DIV></BODY></HTML>

------=_NextPart_000_0130_01C2406B.3F0A6780--



Other related posts:

  • » [Ilugc] HATS OFF IIT for raising India's image again........... - ssvel