PRIMES is in P
Samuel S. Wagstaff, Jr. - CERIAS
Feb 12, 2003PDF ()
AbstractOn August 6, 2002, Manindra Agrawal, Neeraj Kayal, and Nitin Saxena
of the Indian Institute of Technolgy in Kanpur announced that there
is a deterministic polynomial-time algorithm for testing whether
a number is prime or composite.
Their paper is available at: http://www.cse.iitk.ac.in/primality.pdf
We will explain what this terminology means, why we should care,
what was known before their work, and what their new algorithm is.
The views, opinions and assumptions expressed in these videos are those of the presenter and do not necessarily reflect the official policy or position of CERIAS or Purdue University. All content included in these videos, are the property of Purdue University, the presenter and/or the presenter’s organization, and protected by U.S. and international copyright laws. The collection, arrangement and assembly of all content in these videos and on the hosting website exclusive property of Purdue University. You may not copy, reproduce, distribute, publish, display, perform, modify, create derivative works, transmit, or in any other way exploit any part of copyrighted material without permission from CERIAS, Purdue University.