To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

From Wikipedia, the free encyclopedia

Neeraj Kayal (Hindi: नीरज कयाल) is an Indian computer scientist and mathematician noted for development of the AKS primality test, along with Manindra Agrawal and Nitin Saxena. Kayal was born and raised in Guwahati, India.

YouTube Encyclopedic

  • 1/3
    Views:
    661
    498
    1 758
  • Proper Learning Algorithms from Lower Bounds for Arithmetic Circuits
  • RMIT 2014 - Prof. Neeraj Kayal, Microsoft Research, Bangalore
  • Solvability of Systems of Polynomial Equations over Finite Fields

Transcription

Early life and education

Kayal was born and raised in Guwahati, India.

Kayal graduated with a B.Tech from the Computer Science Department of the Indian Institute of Technology, Kanpur (IITK), India in 2002. In that year, Neeraj along with Manindra Agrawal and Nitin Saxena proposed the AKS primality test,[1] which attracted worldwide attention, including an article in The New York Times.[2]

Kayal received his PhD in theoretical computer science from the Department of Computer Science and Engineering at the Indian Institute of Technology, Kanpur. He did postdoctoral research at the Institute for Advanced Study in Princeton and at Rutgers University. Since 2008, he has been working with the Microsoft Research Lab India as a researcher.

Awards

Neeraj Kayal was given the Distinguished Alumnus Award of the IITK,[3] for his work in computational complexity theory. He is also a recipient of the Gödel prize[4] and the Fulkerson Prize[5] for the same along with his co-authors. In 2012, he was awarded the Young Scientist Award from the Indian National Science Academy (INSA) for contributions to the development of arithmetic complexity theory including the development of a deterministic algorithm for primality testing, the resolution of the constant fan-in conjecture for depth three circuits, and a reconstruction algorithm for arithmetic formulas.[6]

In 2021, he won the Infosys Prize in Mathematical Sciences.[7] He was awarded the Shanti Swarup Bhatnagar Prize in Mathematical Sciences for the year 2022.[8] The announcement of the awardees for 2022 was however made in 2023.

References

  1. ^ Bornemann, F. Primes is in P: A Breakthrough for "Everyman". Notices of the AMS, May 2003.
  2. ^ Robinson, S. (8 August 2002). "New Method Said to Solve Key Problem in Math". The New York Times.
  3. ^ IIT Kanpur Alumni Association, Distinguished Alumnus Award Profile: Neeraj Kayal Archived 9 September 2005 at the Wayback Machine
  4. ^ European Association for Theoretical Computer Science (EATCS) announcement of 2006 Godel prize [1]
  5. ^ Fulkerson Prize Announcements
  6. ^ Young Scientists 2012 Award Announcement
  7. ^ "Infosys Prize - Laureates 2021 - Dr. Neeraj Kayal". www.infosys-science-foundation.com. Retrieved 3 December 2021.
  8. ^ "Awardee Details: Shanti Swarup Bhatnagar Prize 2022". ssbprize.gov.in.

External links

This page was last edited on 15 September 2023, at 06:46
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.