
	Where results make sense

Topic: Manindra Agrawal

Related Topics

Manindra Agarwal

AKS primality test

Clay Research Award

Indian Institutes of Technology

Terence Tao

Laurent Lafforgue

Prime number

Xaveer De Geyter

Model minority

Ahmedabad

Alain Connes

History of Ahmedabad

Gujarat state, India

Better Luck Tomorrow

Ahmed Shah

In the News (Sat 28 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	[No title]
		Agrawal is a 36-year old theoretical computer scientist at the Indian Institute of Technology in Kanpur, India.
		Agrawal speak said, with considerable pride, that he was obviously one of them, because of the way he proceeded purposely - "algorithmically" is the word they used - toward his goal.
		Agrawal is the first to admit that his work, for all its elegant math, has no immediate practical application.
	www.gettysburg.edu /~dglass/fall03/agrawal.txt (777 words)

	Fields Institute - Manindra Agrawal
		Manindra Agrawal was born in May 1966, and since 2001 he has been a full professor at the Indian Institute of Technology in Kanpur, India.
		To the great surprise of the experts, Agrawal solved this problem in August 2002, working together with two undergraduate students: Neeraj Kayal and Nitin Saxena.
		Their proof establishes the correctness of a conjecture made in 1999 by Agrawal and Biswas.
	www.fields.utoronto.ca /programs/scientific/02-03/lectures/agrawal (141 words)

	Manindra agrawal (Site not responding. Last check: 2007-11-04)
		Manindra Agrawal, Neeraj Kayal, Nitin Saxena, "PRIMES is in P...
		Agrawal, Manindra Agrawal, Manindra Agrawal, Manindra Agrawal, Manindra...
		manindra agrawal manindra agrawal manindra agrawal manindra agrawal manindra agrawal
	www.factoring.webfinance.ws /factoring_calculator/manindra_agrawal.php (2024 words)

	Manindra Agrawal, Nitin Saxena, Neeraj Kayal (Site not responding. Last check: 2007-11-04)
		In 2002, Manindra Agrawal of the Indian Institute of Technology-Kanpur attained instant celebrity status for devising an elegant algorithm for primality testing.
		Agrawal and two young (22-yr old) collaborators, Neeraj Kayal and Nitin Saxena came up with the first deterministic polynomial time algorithm for primality testing.
		As a testament to this, Agrawal was recently awarded the Clay Research Award, one of the coveted honors in mathematical research.
	technovators.mit.edu /Winners2003/Agrawal_Manindra.html (189 words)

	Manindra agrawal (Site not responding. Last check: 2007-11-04)
		Manindra Agrawal has been awarded the Clay Research Award given by the Clay Mathematical Institute for his...
		manindra agrawal pRIMES is in P, Manindra Agrawal, Neeraj Kayal, Nitin SaxenaManindra Agrawal, Neeraj Kayal and Nitin Saxena.
		Manindra Agrawal (मणीन्द्र अग्रवाल) (born 20 May 1966 in Allahabad) is a...
	www.factoring.webfinance.ws /factorization/manindra_agrawal.php (1975 words)

	2006 Gödel Prize (Site not responding. Last check: 2007-11-04)
		Agrawal, Kayal, and Saxena presented an unconditional deterministic polynomial time algorithm that determines whether an input number is prime or composite.
		The result obtained by Agrawal, Kayal, and Saxena can be seen as a crowning achievement of a long algorithmic and mathematical quest.
		The award-winning paper makes use of a new probabilistic algorithm by Agrawal and Somenath Biswas, presented at FOCS 1999, which Agrawal, Kayal, and Saxena were able to derandomize.
	sigact.acm.org /prizes/godel/2006.html (352 words)

	DBLP: Manindra Agrawal
		Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the complexity of reductions.
		Manindra Agrawal, Eric Allender, Steven Rudich: Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem.
		Manindra Agrawal, Srinivasan Venkatesh: On the Isomorphism Conjecture for 2-DFA Reductions.
	informatik.uni-trier.de /~ley/db/indices/a-tree/a/Agrawal:Manindra.html (624 words)

	The Code War - How Safe is Safe?
		Manindra Agrawal, Neeraj Kayal, and Nitin Saxena of the Indian Institute of Technology in Kanpur, India, astounded the mathematical world when they discovered an improved version of Fermat’s test that has no exceptions.
		Thanks to Agrawal, Kayal, and Saxena, the first of these two statements can now be made confidently, without any hemming and hawing about pseudoprimes.
		Primes is in P - The announcement of the discovery of the prime testing algorithm by Manindra Agarwal, Neeraj Kayal, and Nitin Saxena.
	www.beyonddiscovery.com /content/view.page.asp?I=3430 (887 words)

	A prime solution
		Manindra Agrawal, a CSE professor and his two B.Tech students, Neeraj Kayal and Nitin Saxena, have discovered this "polynomial time" algorithm that had eluded the best of minds in the game for decades.
		Agrawal had the conviction that the solution to the problem lay in algorithmically computing the equation for the given number n and showing that it vanishes if it is a prime.
		Agrawal is a home-grown scientist who began his work on complexity theory under Biswas at IIT-K itself.
	www.hindu.com /fline/fl1917/19171290.htm (2831 words)

	Professional Opportunities
		One Sunday last month, Manindra Agrawal, a professor of computer science at the Indian Institute of Technology in Kanpur, quietly sent a postscript file to a dozen or so experts in theoretical computer science and computational number theory.
		In general, evaluating the left-hand side of this congruence takes exponential time, but Agrawal, Kayal, and Saxena were able to use a clever trick to simplify the congruence to one that loses some information but can be computed in polynomial time.
		Agrawal hopes that some of the techniques of the new algorithm might give a new perspective on factoring.
	www.siam.org /siamnews/09-02/primality.htm (1463 words)

	AIM to host workshop on number theoretic algorithms
		The brainstorming session is a response to the recent breakthrough in primality testing announced by computer scientist Manindra Agrawal, of the Indian Institute of Technology in Kanpur, and his students Neeraj Kayal and Nitin Saxena.
		Agrawal's August 6 announcement of a fast method for detecting prime numbers caught the mathematical world by surprise.
		The new algorithm developed by Agrawal and his team is stunningly simple and scales remarkably well.
	www.aimath.org /releaseprimesinp.html (1017 words)

	Mathematical Programming Society Fulkerson Prize Citation
		Manindra Agrawal, Neeraj Kayal and Nitin Saxena, "PRIMES is in P", Annals of Mathematics, Volume 160, issue 2, 2004, Pages 781--793.
		The existence of short certificates for both compositeness and primality was known since the 70's and suggested that primality testing might be in P. Yet, despite numerous efforts and a flurry of algorithms, it was not until 2002 that Agrawal, Kayal and Saxena devised the first deterministic polynomial-time algorithm for primality testing.
		It shows, for example, that embeddability in any fixed surface can be characterized by a finite list of excluded minors, or that the disjoint paths problem can be solved in polynomial time for a fixed number of terminals.
	www.mathprog.org /prz/citations/fulkerson_2006.htm (491 words)

	Computer Science and Engineering Department, IIT Kanpur
		Professor Manindra Agrawal awarded the prestigious JC Bose Fellowship 2006 by the DST [details]
		Manindra Agrawal, Neeraj Kayal and Nitin Saxena awarded Fulkerson Prize for 2006 [details]
		Manindra Agrawal, Neeraj Kayal and Nitin Saxena awarded ACM SIGACT Godel Prize for 2006 [details]
	www.cse.iitk.ac.in (139 words)

	Gregory West
		Although the Agrawal algorithm is slower than the Rabin-Miller test can be, it is guaranteed to return a definitive answer on whether or not the input is prime.
		Alternatively, Agrawal’s algorithm only determines whether or not a number is prime; it does not actually return a divisor.
		(1) Agrawal, Manindra, Neeraj Kayal, and Nitin Saxena.
	www.its.caltech.edu /~sciwrite/journal03/west.html (3312 words)

	Clay Mathematics Institute
		This meeting provided a public forum for discussion among leading mathematicians and scientists, and it strengthened relations between mathematicians, the public, and the scientific research community.
		The meeting began with the presentation of the 2002 Clay Research Award to Oded Schramm (for his work on the Loewner equation) and to Manindra Agrawal (for his work on primality testing).
		Manindra Agrawal of the Indian Institute of Technology surprised all experts in August 2002 by solving an ancient problem (working with two undergraduate students).
	www.claymath.org /annual_meeting/2002_Annual_Meeting (350 words)

	Data Security and Cryptography Project - ECE 575
		Manindra Agrawal, Neeraj Kayal and Nitin Saxena [AKS2002] released a paper describing a unconditional deterministic polynomial-time algorith for primality testing which sought to eliminate any difficulties associated with previous methods of primality testing.
		The algorithm was first described in a paper written by Agrawal, Neeraj and Saxena [AKS2002] in 2002.
		Agrawal, M., Saxena, N. & Kayal, N. PRIMES in P August 6, 2002.
	islab.oregonstate.edu /koc/ece575/04Project2/Miller/ece575.html (967 words)

	Google helps crack the prime number test
		Manindra Agrawal, a mathematician at the Indian Institute of Technology in Kanpur, India, discovered a definitive test for prime numbers in August.
		The formula for determining that numbers are prime has eluded mathematicians for centuries.
		Agrawal said he sometimes had to use Google to find information on the more recondite aspects of number theory," reports Lee Gomes.
	weblog.blogads.com /comments/124_0_1_0_C (85 words)

	NSF Wins 12% Boost From Senate (Site not responding. Last check: 2007-11-04)
		Three computer scientists at the Indian Institute of Technology in Kanpur have found a provably efficient algorithm for testing primes (whole numbers evenly divisible only be themselves and 1).
		Manindra Agrawal, a professor of computer science, and two students, Neeraj Kayal and Nitin Saxena, announced their result early this month, e-mailing copies of it to a number of experts in computational number theory.
		What especially intrigues number theorists is that the algorithm and the proof of its efficiency are both very simple.
	bric.postech.ac.kr /science/97now/02_8now/020815c.html (382 words)

	Bhatnagar Prize (Site not responding. Last check: 2007-11-04)
		The algorithm is based on a totally new proof technique which has ushered in a new era in computational number theory.
		Recently Professor Agrawal received the Shanti Swarup Bhatnagar Prize for the year 2003 in mathematical sciences for his contribution to work in prime numbers from the Prime Minister of India Dr. Manmohan Singh.
		Professor Agrawal is married and he has two daughters.
	www.iitk.ac.in /dofa/award/bhatnagar.htm (446 words)

	Indian maths geniuses refused US visas
		LEE GOMES IN THE Wall Street Journal reports on Manindra Agrawal and his whistle stop tour of the USA.
		Agrawal has solved a method to decide whether a number is prime or not, although even the Indian boffin admits there's no practical use to the solution, elegant as it may be.
		Agrawal's work on prime numbers, which might earn him a Nobel prize and could upset the apple cart of Internet security, was accomplished with two other Indians – Nitin Saxena and Neeraj Kayal.
	www.theinquirer.net /default.aspx?article=6065 (299 words)

	Computational Complexity: Talks by Manindra Agrawal (Site not responding. Last check: 2007-11-04)
		I don't usually give talk announcements in this web log, but if you are in the Boston area this week you can see Manindra Agrawal give talks about prime numbers and his new algorithm with Kayal and Saxena.
		This new algorithm, giving the first provably deterministic polynomial-time algorithm to check primality, will go down as one of the classic results in theoretical computer science.
		Manindra is giving a non-technical talk on the history of primes at the Clay Mathematics Institute on Wednesday and technical talks on the primality algorithm at MIT on Thursday and Harvard on Friday.
	weblog.fortnow.com /2002/10/talks-by-manindra-agrawal.html (139 words)

	New Method Said to Solve Key Problem in Math (Site not responding. Last check: 2007-11-04)
		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.
		Still, for mathematicians and computer scientists, the new algorithm represents a great achievement because, they said, it simply and elegantly solves a problem that has challenged many of the best minds in the field for decades.
		Asked why he had the courage to work on a problem that had stymied so many, Dr. Agrawal replied in an e-mail message: "Ours was a completely new and unexplored approach.
	www.hvk.org /articles/0802/126.html (494 words)

	Wired News: Primed for a Math Breakthrough
		For three years, Manindra Agrawal, a professor at the Indian Institute of Technology, Kanpur, grappled with the beginnings of a solution to one of the most famous problems known to man: How do we conclusively identify that an enormous number is prime?
		From the moment he distributed his report, Agrawal received excited approval from fellow mathematicians.
		The significance of Agrawal's algorithm, Lenstra said, "is that it solves a famous problem."
	www.wired.com /news/technology/0,1282,54613,00.html (728 words)

	manindra agrawal - ResearchIndex document query (Site not responding. Last check: 2007-11-04)
		PRIMES is in P Manindra Agrawal, Neeraj Kayal and Nitin Saxena Department
		An Isomorphism Theorem and a Gap Theorem Manindra Agrawal, Eric Allender, Steven Rudich
		AKS02] Manindra Agrawal, Neeraj Kayal, and Nitin Saxena.
	citeseer.ist.psu.edu /cis?q=Manindra+Agrawal (520 words)

	HIMAL SOUTH ASIAN \| October 2002 \| Briefs (Site not responding. Last check: 2007-11-04)
		Three computer scientists, Manindra Agrawal, Neeraj Kayal and Nitin Saxena from the Indian Institute of Technology, Kanpur, delighted the mathematical world by solving a problem that has frustrated mathematicians for many years.
		Agrawal, Kayal and Saxena have managed to solve precisely this problem.
		Agrawal, Kayal and Saxena end their paper by posing another problem to the mathematical world where they point out that an answer to it would lead to an even faster method for distinguishing primes from composites.
	www.himalmag.com /2002/october/briefs.htm (3196 words)

	The Clay Mathematics Institute 2002 Annual Meeting
		The Annual Meeting is open to the public.
		The meeting will begin with the presentation of the 2002 Clay Research Award to Oded Schramm (for his work on the Loewner equation) and to Manindra Agrawal (for his work on primality testing).
		Manindra Agrawal of the Indian Institute of Technology surprised all experts in August 2002 by solving a hundred-year old problem (working with two undergraduate students).
	www.eurekalert.org /pub_releases/2002-10/tcmi-tcm102502.php (511 words)

	South Coast Repertory Playgoers Guide - 'Proof'
		On Aug, 6, the Indian mathematician Manindra Agrawal distributed a nine-page paper that rocked the scientific world.
		He had hit upon an ingenious algorithm to prove whether a number is prime, no matter how enormous.
		What’s more, they employed a branch of math with which any high-school student would be familiar: polynomials, like the simple expression (A+B)2.
	www.scr.org /season/02-03season/studyguides/proof/outsider.html (394 words)

Try your search on: Qwika (all wikis)