Neeraj Kayal graduated with a B.Tech from the Computer Science Department of the Indian Institute of Technology, Kanpur, India in 2002. He, Manindra Agrawal and Nitin Saxena proposed the AKS Primality Test in 2002, which attracted worldwide attention. This research remarkably came out as a part of undergraduate study. B.Tech is the short form for Bachelor of Technology. ... Wikibooks Wikiversity has more about this subject: School of Computer Science Open Directory Project: Computer Science Downloadable Science and Computer Science books Collection of Computer Science Bibliographies Belief that title science in computer science is inappropriate Categories: | ... The Indian Institute of Technology, Kanpur (IIT Kanpur) is one of the Indian Institutes of Technology, set up in the (then) industrial city of Kanpur in 1960. ... 2002 (MMII) was a common year starting on Tuesday of the Gregorian calendar. ... Manindra Agrawal (मणीनà¥à¤¦à¥à¤° अगà¥à¤°à¤µà¤¾à¤²) (born 20 May 1966 in Allahabad) is a professor of computer science at the Indian Institute of Technology, Kanpur. ... Nitin Saxena is a Doctoral student at the Computer Science Department of the Indian Institute of Technology, Kanpur, India. ... The AKS primality test (also known as Agrawal-Kayal-Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by three Indian scientists named Manindra Agrawal, Neeraj Kayal and Nitin Saxena on August 6, 2002 in a scientific paper titled PRIMES is in P... In some educational systems, an undergraduate is a post-secondary student pursuing a Bachelors degree. ...
He was given the Distinguished Alumnus Award of the Indian Institute of Technology, Kanpur, for his work in computational complexity theory. An alumn (with a silent n), alum, alumnus, or alumna is a former student of a college, university, or school. ... In computer science, computational complexity theory is the branch of the theory of computation that studies the resources required during computation to solve a given problem. ...
External links
Profile of Neeraj Kayal at the IIT Kanpur Alumni Association
NeerajKayal obtained his B Tech in Computer Science and Engineering in 2001 from the Indian Institute of Technology Kanpur and is currently a Doctoral student in the same department.
As a B Tech student, NeerajKayal was part of the team that recently announced a polynomial time algorithm for primality testing.
NeerajKayal 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.
Feeds |
Contact