Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The P = NP Problem Manindra Agarwal
 

Summary: The P = NP Problem
Manindra Agarwal
IIT Kanpur
CNR Rao Lecture, 2008
Manindra Agarwal (IIT Kanpur) The P = NP Problem CNR Rao Lecture, 2008 1 / 47
Outline
1 Motivation
2 Formal Definitions
3 First Attempt: Diagonalization
4 Second Attempt: Circuit Lower Bounds
5 Third Attempt: Pseudo-random Generators
Manindra Agarwal (IIT Kanpur) The P = NP Problem CNR Rao Lecture, 2008 2 / 47
The Traveling Salesman Problem
Suppose that you are given the road map of India.
You need to find a traversal that covers all the cities/towns/villages
of population 1, 000.
And the traversal should have a short distance, say, 9, 000 kms.
You will have to generate a very large number of traversals to find out
a short traversal.
Suppose that you are also given a claimed short traversal.

  

Source: Agrawal, Manindra - Department of Computer Science and Engineering, Indian Institute of Technology Kanpur

 

Collections: Computer Technologies and Information Sciences