# Manindra Agrawal

> Indian computer scientist

**Wikidata**: [Q93029](https://www.wikidata.org/wiki/Q93029)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Manindra_Agrawal)  
**Source**: https://4ort.xyz/entity/manindra-agrawal

## Summary
Manindra Agrawal is an Indian computer scientist and mathematician known for his contributions to number theory and computational complexity, particularly the AKS primality test. He is a professor at the Indian Institute of Technology Kanpur and has received numerous prestigious awards including the Gödel Prize and the Shanti Swarup Bhatnagar Prize.

## Biography
- Born: 1966-05-20 (or 1966-05-02 based on different references), Prayagraj
- Nationality: India
- Education: Ph.D. from Indian Institute of Technology Kanpur under Somenath Biswas
- Known for: Development of the AKS primality test
- Employer(s): Indian Institute of Technology Kanpur
- Field(s): Number theory, computer science

## Contributions
Manindra Agrawal is most famous for developing the AKS primality test (2002), a deterministic algorithm that determines whether a number is prime or composite in polynomial time. This groundbreaking work solved the long-standing open problem of finding a polynomial-time algorithm for primality testing. The AKS algorithm was published in the journal Annals of Mathematics and has had significant impact on number theory and cryptography. He has also made contributions to computational number theory and complexity theory, with over 100 research publications.

## FAQs
### Q: What is Manindra Agrawal's most famous achievement?
A: He developed the AKS primality test, a polynomial-time algorithm for determining whether a number is prime.

### Q: What awards has he received?
A: He has received the Gödel Prize (2006), Shanti Swarup Bhatnagar Prize (2003), and other prestigious awards including the Fulkerson Prize and Infosys Prize.

### Q: Where does he work?
A: He is a professor at the Indian Institute of Technology Kanpur.

## Why They Matter
Manindra Agrawal's work on the AKS primality test fundamentally changed number theory and computational complexity by providing the first known polynomial-time algorithm for primality testing. This achievement resolved a long-standing open problem and has had profound implications for cryptography, computer science, and number theory. His work has influenced generations of researchers and established new directions in computational number theory.

## Notable For
- Developed the AKS primality test (2002), solving the long-standing problem of polynomial-time primality testing
- Received the Gödel Prize (2006) and Shanti Swarup Bhatnagar Prize (2003)
- Awarded the Fulkerson Prize (2006) and Infosys Prize (2008)
- Member of multiple national scientific academies including the National Academy of Sciences and Indian Academy of Sciences
- Has an Erdős number of 3

## Body
### Academic Background
Manindra Agrawal was born on May 20, 1966 (or May 2, 1966 according to alternative references) in Prayagraj, India. He received his Ph.D. from the Indian Institute of Technology Kanpur under the guidance of Somenath Biswas. His doctoral research focused on number theory and computational complexity.

### Research Contributions
Agrawal's most significant contribution is the AKS primality test, co-developed with Neeraj Kayal and Nitin Saxena. This algorithm provides a deterministic polynomial-time solution to the primality testing problem, which was previously thought to require superpolynomial time. The AKS test works by checking whether a number n can be expressed as a perfect power or as a product of two smaller numbers.

The AKS algorithm has been implemented in various programming languages and has found applications in cryptography, particularly in the verification of prime numbers used in public key systems. The paper describing the AKS test was published in the Annals of Mathematics in 2002 and has been cited extensively in subsequent research.

### Academic Career
Agrawal has maintained a long-term affiliation with the Indian Institute of Technology Kanpur, where he currently serves as a professor in the Computer Science and Engineering department. He has supervised numerous doctoral students including Neeraj Kayal, Nitin Saxena, and others who have made their own contributions to number theory and computational complexity.

### Recognition and Awards
Agrawal has received numerous prestigious awards throughout his career:
- Shanti Swarup Bhatnagar Prize for Science and Technology (2003)
- Gödel Prize (2006) and Fulkerson Prize (2006) for the AKS primality test
- G.D. Birla Award for Scientific Research (2009)
- Infosys Prize (2008) for mathematical sciences
- TWAS Prize for Mathematics (2010)
- Humboldt Research Fellowship and Humboldt Prize

He is also a member of several national scientific academies including the National Academy of Sciences, Indian National Science Academy, The National Academy of Sciences, India, and the Indian Academy of Sciences.

### Impact on Field
The AKS primality test fundamentally changed the landscape of number theory and computational complexity. Before this work, the best-known algorithms for primality testing were subexponential time algorithms. The AKS algorithm provided the first known polynomial-time solution, which has had lasting implications for cryptography, computer science, and number theory. The algorithm's simplicity and elegance have made it a textbook example in many computer science courses.

### Professional Affiliations
Agrawal has maintained strong connections with international academic communities. He has served as a visiting professor at various institutions and has collaborated with researchers worldwide. His work has influenced subsequent research in computational number theory and has inspired new directions in the field.

```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Manindra Agrawal",
  "jobTitle": "Professor of Computer Science",
  "worksFor": {"@type": "Organization", "name": "Indian Institute of Technology Kanpur"},
  "nationality": {"@type": "Country", "name": "India"},
  "birthDate": "1966-05-20",
  "birthPlace": "Prayagraj",
  "alumniOf": [{"@type": "EducationalOrganization", "name": "Indian Institute of Technology Kanpur"}],
  "knowsAbout": ["Number theory", "Computational complexity", "Primality testing"],
  "sameAs": ["https://www.wikidata.org/wiki/Q423048", "https://en.wikipedia.org/wiki/Manindra_Agrawal"]
}

## References

1. Integrated Authority File
2. [Source](https://sigact.org/prizes/g%C3%B6del.html)
3. [Source](https://www.ams.org/prizes-awards/pabrowse.cgi?parent_id=17)
4. Mathematics Genealogy Project
5. International Standard Name Identifier
6. Virtual International Authority File
7. Czech National Authority Database
8. Freebase Data Dumps. 2013
9. IdRef