
	Where results make sense

Topic: Nitin Saxena

	IITKAA - DAA Profile
		Nitin Saxena obtained his B Tech in Computer Science and Engineering in 2001 from the Indian Institute of Technology Kanpur where he is currently a Doctoral student.
		As a B Tech student, Nitin Saxena was part of the team that recently announced a polynomial time algorithm for primality testing.
		Nitin Saxena has been conferred with the Distinguished Alumnus Award of the Indian Institute of Technology Kanpur for his outstanding contributions in Complexity Theory by developing a Polynomial Time Algorithm for Primality Testing.
	www.iitkalumni.org /daa/DAAProfile2.asp?id=39 (291 words)

	DBLP: Nitin Saxena
		Manindra Agrawal, Nitin Saxena: Equivalence of F-Algebras and Cubic Forms.
		Neeraj Kayal, Nitin Saxena: On the Ring Isomorphism and Automorphism Problems.
		Manindra Agrawal, Nitin Saxena: Automorphisms of Finite Rings and Applications to Complexity of Problems.
	www.vldb.org /dblp/db/indices/a-tree/s/Saxena:Nitin.html (118 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)

	European Association for Theoretical Computer Science
		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.
	www.eatcs.org /activities/awards/goedel2006.html (363 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.
		Part of what Agrawal, Saxena and Kayal were trying to accompished was also time based.
	islab.oregonstate.edu /koc/ece575/04Project2/Miller/ece575.html (967 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.
		There are several algorithms in vogue for testing primality, but they are either probabilistic (with small probabilities for returning a composite number as a prime or failing on a prime number) or conditional (like using some unproven hypothesis), or deterministic and unconditional but working in non-polynomial time.
		Guwahati-born Kayal and Allahabad-born Saxena seem unfazed by all the excitement and are keen to continue working in complexity theory.
	www.flonnet.com /fl1917/19171290.htm (2831 words)

	Kanpur IITians' Math feat hailed by world- The Times of India (Site not responding. Last check: 2007-11-05)
		KANPUR: Professor Manindra Agarwal of the Indian Institute of Technology along with his students Neeraj Kayal and Nitin Saxena have solved one of the vexing problems of mathematics.
		It has been, therefore, a major challenge in computer science and mathematics to design an algorithm, which is both efficient and always correct.
		Neeraj, and Nitin of the department of computer science and engineering, were very innovative.
	timesofindia.indiatimes.com /articleshow/msid-18609261,prtpage-1.cms (458 words)

	Manindra Agrawal, Nitin Saxena, Neeraj Kayal (Site not responding. Last check: 2007-11-05)
		Algorithms exist, which will efficiently tell you whether or not a given number is prime, albeit with a small degree of uncertainty, but none could test for primality in a deterministic fashion in a reasonable amount of time.
		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.
		Though of limited practical application in its current form (the randomized algorithms work faster and are good enough in practice), this discovery marks an important breakthrough in our understanding of number theory.
	technovators.mit.edu /Winners2003/Agrawal_Manindra.html (189 words)

	IITBHF and IITBAA (http://www.iitbombay.org)
		Manindra Agarwal and two of his students, Nitin Saxena and Neeraj Kayal, both B.Tech.
		Current computer recipes, or algorithms, are fast, but have a small chance of giving either a wrong answer or no answer at all.
		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.
	www.iitbombay.org /misc/press/nyt080802.htm (590 words)

	Clay Mathematics Institute
		Although random algorithms can solve this problem with high certainty in polynomial time, it remained a long-standing challenge to find a method that works in every case.
		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.claymath.org /research_award/Agrawal (180 words)

	Prime Pursuit: Science News Online, Oct. 26, 2002 (Site not responding. Last check: 2007-11-05)
		Mathematicians quickly confirmed the validity of the results, and some researchers have already made improvements, offering hope that this novel approach eventually may be turned into a practical, speedy method for finding primes.
		He enlisted the aid of Kayal and Saxena, who were undergraduate students at the time.
		Early computer simulations were encouraging, but only this past summer did the team finally work out the complete method and the mathematical proof establishing its theoretical efficiency.
	www.sciencenews.org /20021026/bob9.asp (1758 words)

	akash saxena - ResearchIndex document query
		PRIMES is in P - Agrawal, Kayal, Saxena (2002)
		Ki-Wook Kim 1 Seong-Ook Jung 2 Prashant Saxena 3 C.L.Liu 4 and Sung-Mo Kang 5 1 Pluris,
		1994 Keen 1986 Parfett 1992 Pfeiffer 1992 Saxena and Wagenaar 1995 Scala and McGrath 1993
	citeseer.ist.psu.edu /cis?q=Akash+Saxena (603 words)

	BTech Project Abstract - Towards a deterministic polynomial-time Primality Test by Neeraj Kayal and Nitin Saxena
		Neeraj Kayal(98226) and Nitin Saxena (98247), April, 2002
		We examine a primality testing algorithm presented in Primality and Identity Testing via Chinese Remaindering: FOCS 1999 and the related conjecture in Prashant and Rajat: BTP-report 2001.
		Based on our computations and results proved in this paper we feel that unlike other tests, this test is very promising as the related conjecture seems provable.
	www.cse.iitk.ac.in /research/btp2002/primality.html (157 words)

	Research News - Direct Observation of Neutrino Oscillations - Resonance - Oct 2002
		A Polymomial Time Algorithm to Test if a Number is a Prime or Not
		Manindra Agrawal (36), Professor of Computer Science and Engineering at the Indian Institute of Technology, Kanpur, along with two BTech students of his, Neeraj Kayal (22) and Nitin Saxena (21) have solved the age old problem of finding a ‘polynomial time’ algorithm that decides whether a given number is a prime or not.
		Such an algorithm has been eluding the best mathematicians and computer scientists for several decades.
	www.iisc.ernet.in /~academy/resonance/Nov2002/Nov2002ResearchNews.html (123 words)

	How to Download Output of Script or SmartForm - ITtoolbox Groups (Site not responding. Last check: 2007-11-05)
		Mahesh 3/10/2004 - Hi Nitin Saxena, Thanks For Ur Answer.
		Mahesh 3/10/2004 - Hi Nitin, How to Fetch the Spool Number.
		Mahesh 3/12/2004 - Hi NItin, It Doesn't Work When Made Modification In Perform Statement.
	www.crmassist.com /groups/technical-functional/sap-r3-dev/430775 (687 words)

	Btech98 (Site not responding. Last check: 2007-11-05)
		Recently, two of the members, Neeraj and Nitin have made it big with their breakthrough in cracking the age old problem of primality testing.
		Their paper PRIMES is in P has been hailed as the best result in computational theory in the last decade.
		We kept our memories forever by taking lots of photographs and even shooting a video.
	www-db.stanford.edu /~usriv/friends/Btech98.htm (175 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)

	Research News - Direct Observation of Neutrino Oscillations - Resonance - Oct 2002
		A Polymomial Time Algorithm to Test if a Number is a Prime or Not
		Manindra Agrawal (36), Professor of Computer Science and Engineering at the Indian Institute of Technology, Kanpur, along with two BTech students of his, Neeraj Kayal (22) and Nitin Saxena (21) have solved the age old problem of finding a ‘polynomial time’ algorithm that decides whether a given number is a prime or not.
		Such an algorithm has been eluding the best mathematicians and computer scientists for several decades.
	www.ias.ac.in /resonance/Nov2002/Nov2002ResearchNews.html (123 words)

	EVENTS for 9/6/2002 (Site not responding. Last check: 2007-11-05)
		Primality Detection in Polynomial Time (after Agrawal, Kayal, & Saxena)
		Abstract: On August 6, 2002, Manindra Agrawal, and two of his students (Neeraj Kayal and Nitin Saxena), from the Computer Science department of the Indian Institute of Technology (Kanpur) posted on a web-site a preprint proving the following:
		Deciding whether an integer n is prime can be done within O(log^{12} n) bit operations, i.e., time polynomial in the number digits.
	www.math.tamu.edu /Calendar/cal-getday.pl?9_6_2002 (226 words)

Try your search on: Qwika (all wikis)