Proving Lower Bounds to answer the P versus NP Question
-
Upload
guest383ed6 -
Category
Technology
-
view
389 -
download
0
description
Transcript of Proving Lower Bounds to answer the P versus NP Question
![Page 1: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/1.jpg)
Proving Lower Bounds to answer the P versus NP Question
Prerna Thakral
George Mason University
Computer Science
![Page 2: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/2.jpg)
How did we get P versus NP?• Turing developed a model for his
computational theory, but it failed to account for• time • memory
• Divided theoretical computer science problems into two classes – P and NP.
![Page 3: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/3.jpg)
BACKGROUND INFORMATION
![Page 4: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/4.jpg)
What does the P class hold?• P is for Polynomial Time.
• Problems whose positive solutions can be solved in an amount of time that is polynomial to the size of the input.
![Page 5: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/5.jpg)
What does NP class hold? • NP stands for Nondeterministic Polynomial
Time.
• Problems that can be verified in polynomial time.
![Page 6: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/6.jpg)
Relationship between P and NP
![Page 7: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/7.jpg)
How did P and NP come to existence?
• P became the class of those problems that were “realistically solvable.”
• NP class became important once the computer scientists realized the large number of problems contained in it that still needed to be solved.
![Page 8: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/8.jpg)
Importance and Consequences• A proof of P equals NP:
• will lead to efficient methods for solving some important NP problems
• fundamental to many fields such as mathematics, biology, etc.
• A proof of P does not equal NP:• will show, in a formal way, that many common
problems that can be verified easily and efficiently cannot be solved efficiently.
![Page 9: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/9.jpg)
CURRENT RESEARCH - PROVING LOWER BOUNDS
![Page 10: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/10.jpg)
Limitations in Problem• Is seen when computer scientists
have tried to prove lower bounds on the complexity of problems in the class, NP.
• Methods such as:• Diagonalization• the use of pseudo-random generators • Circuits
are currently being used to prove lower bounds.
![Page 11: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/11.jpg)
Terminology• Diagonalization - a basic technique
used to prove that the set A does not belong to complexity class C.
• Combinatorial Circuit - a sequence of instructions, each producing a function based on the already obtained previous functions.
![Page 12: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/12.jpg)
Goal of the Research • Develop a new technique in determining lower
bounds by conducting an experiment between the current techniques, diagonalization, and combinatorial circuits and comparing the results to answer the P versus NP question.
![Page 13: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/13.jpg)
EXPERIMENTMethods and Procedures
![Page 14: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/14.jpg)
Constants in the Experiment
• Lower bounds will be computed on the Traveling Salesman Problem, an NP-complete problem.
• The traveling salesman problem will include 15 cities to be toured.
![Page 15: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/15.jpg)
Trials One and Two• Diagonalization Technique - a set and function
A will be established.
• Circuit Technique - a circuit tree will be created from previously defined functions.
![Page 16: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/16.jpg)
Trial Three• Set A will use the diagonalization technique and
the combinatorial circuits simultaneously to achieve higher efficiency.
![Page 17: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/17.jpg)
EXPERIMENTAssessment
![Page 18: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/18.jpg)
Efficiency • Efficiency is:
• measured by the time required to complete the technique and analyze the results to see if the technique produced anything meaningful.
• Time required to find a set A will be important.
• The time required to create these various circuit trees will also be noted.
![Page 19: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/19.jpg)
Success• The experiment will be declared as successful if
the new technique which uses the two current techniques simultaneously is seen to be more efficient than the other techniques in proving lower bounds.
![Page 20: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/20.jpg)
EXPERIMENTNext Steps
![Page 21: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/21.jpg)
Prove P equals/does not equal NP
• I will be able to determine that the Traveling Salesman Problem is a part of the P class.
• This will allow me to determine which other NP-complete problems can be solved in polynomial time, making them a part of the P class.
![Page 22: Proving Lower Bounds to answer the P versus NP Question](https://reader035.fdocuments.in/reader035/viewer/2022070302/5480f29bb4af9fb4158b5de0/html5/thumbnails/22.jpg)
Publish Results• If successful, I would like to publish my findings
in scholarly journals such as:• IEEE Journal • Communications of ACM IEEE
Journal