
	Where results make sense

Topic: Manindra Agarwal

Related Topics

Manindra Agrawal

IIT Kharagpur

Clay Research Award

Jack Dongarra

Madhu Sudan

IIT Roorkee

Leslie Lamport

Tao Yang

Alfred Aho

Stephen Wolfram

Indian Institutes of Technology

Narendra Karmarkar

List of computer scientists

Nevanlinna Prize

Ravi Arimilli

In the News (Sat 5 Jul 08)

Gordon Brown

Derby County

Mike Huckabee

Lute Olson

Pearl Harbor

Sonia Gandhi

Ricky Hatton

Narendra Modi

Jesus Christ

Rudy Giuliani

	Primality test
		In practice, this algorithm is slower than the other two for sizes of numbers that can be dealt with at all.
		In 2002, Manindra Agarwal, Nitin Saxena and Neeraj Kayal described a new deterministic primality test which runs in O(n
		Manindra Agarwal, Nitin Saxena, Neeraj Kayal, "PRIMES is in P", Preprint, August 6, 2002, http://www.cse.iitk.ac.in/news/primality.html
	www.ebroadcast.com.au /lookup/encyclopedia/pr/Prime_testing.html (688 words)

	IITKAA - DAA Profile
		Dr Manindra Agrawal, the 36-year-old professor in the Department of Computer Science and Engineering of the Indian Institute of Technology Kanpur, was born and schooled in Allahabad, after which he joined IIT Kanpur for the B Tech in Computer Science and Engineering.
		Manindra Agrawal is thus a home-grown Computer Scientist who began his work on complexity theory at IIT Kanpur itself.
		Dr Manindra Agrawal is conferred with the Distinguished Alumnus Award of IIT Kanpur for his outstanding contributions in Complexity Theory and by developing a Polynomial Time Algorithm for Primality Testing.
	www.iitkalumni.org /DAA/DAAProfile2.asp?id=34 (432 words)

	rediff.com: IIT professor makes prime mathematics breakthrough
		Manindra Agarwal and two of his students at the Indian Institute of Technology, Kanpur, have found a quick way of solving a timeless problem: how to determine whether a given number is a prime number.
		Agarwal told rediff.com on telephone that "the urge to work out this problem dates back to 1999, though I started working on it as late as in 2001".
		Agarwal then did a four-year stint at the Advanced Institute of Mathematics in Madras before bagging the Humboldt fellowship at the University of Ulm in Germany.
	www.rediff.com /news/2002/aug/10prime.htm (415 words)

	tins ::: Rick Klau’s weblog » Primes in P
		Manindra Agarwal and two of his students, Nitin Saxena and 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.
		Assuming that Agarwal’s discovery will lead to others who can improve upon it, this bodes well for future cryptographers (which will necessarily benefit anyone relying on secure communications).
	www.rklau.com /tins/archives/2002/08/10/primes_in_p.php (274 words)

	About "PRIMES is in P" (Site not responding. Last check: 2007-10-11)
		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.
		The Math Forum is a research and educational enterprise of the Drexel School of Education.
	mathforum.org /library/view/61137.html (78 words)

	IITBHF and IITBAA (http://www.iitbombay.org)
		Manindra Agarwal and two of his students, Nitin Saxena and Neeraj Kayal, both B.Tech.
		The new algorithm - by Manindra Agrawal, Neeraj Kayal and Nitin Saxena of the Indian Institute of Technology in Kanpur - guarantees a correct and timely answer.
		Though their paper has not been published yet, they have distributed it to leading mathematicians, who expressed excitement at the finding.
	www.iitbombay.org /misc/press/nyt080802.htm (590 words)

	Indiaedunews (Site not responding. Last check: 2007-10-11)
		What they do know, however, is that Mr Kayal and Mr Saxena have made a splash in the scientific world, been featured in The New York Times and hailed by classmates as 'total bakait' (campus lingo for super achievers).
		For the two computer science students at IIT (Kanpur), along with their professor Manindra Agarwal, have managed to crack one of the great unsolved problems of mathematics.
		Professor Manindra Agarwal, who had a number of important results to his name and had been working on this problem for some time, agreed to act as their supervisor.
	www.indiaedunews.net /InternationalNews/newstory/status.htm (737 words)

	awards
		Professor Manindra Agrawal (Computer Science and Engineering) and his PhD students Neeraj Kayal and Nitin Saxena have been awarded the Goedel Prize for the year 2006 for their paper "PRIMES is in P, Annals of Mathematics 160, 1-13 (2004)".
		Avinash Kumar Agarwal, Dept. of Mechanical Engineering, has been selected for the INAE Young Engineer Award-2005.
		This award of the Indian National Academy of Engineers will be presented to Dr. Agarwal on December 10 at the Annual Convention of the Academy.
	www.iitk.ac.in /dofa/award/newaward1.htm (694 words)

	Primality testing
		The objective of primality testing is to take as input a positive integer, and return as output a verdict whether the number is prime or composite.
		Only as recently as 2002 was it shown that this age-old problem can be solved in polynomial time; the algorithm was discovered by Manindra Agarwal, Neeraj Kayal, and Nitin Saxena (professor and two graduate students) at the Indian Institute of Technology, Kanpur.
		Euclid used the sieve of Eratosthenes to perform primality testing.
	people.cs.uchicago.edu /~laci/reu03/notes11/node3.html (519 words)

	Computational Complexity Conference Call for Papers (Site not responding. Last check: 2007-10-11)
		Use appendices to substantiate your major technical results.
		Authors with no access to electronic submissions may contact Manindra Agarwal, the program committee chair, by e-mail to him.
		Notifications of accepted papers will go out by February 24th, 2006.
	facweb.cs.depaul.edu /jrogers/complexity/cfp.htm (596 words)

Try your search on: Qwika (all wikis)