 ## Information Technology Consulting Service

 P versus NP problem Options · View
scott
 Posted: Sunday, July 19, 2015 11:10:41 PM
Groups: Member

Joined: 3/24/2008
Posts: 2,808
Points: 5,600
Location: South Florida USA
P versus NP problem

https://en.wikipedia.org/wiki/P_versus_NP_problem

Quote:

The P versus NP problem is a major unsolved problem in computer science. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. It was essentially first mentioned in a 1956 letter written by Kurt Gödel to John von Neumann. Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time. The precise statement of the P versus NP problem was introduced in 1971 by Stephen Cook in his seminal paper "The complexity of theorem proving procedures" and is considered by many to be the most important open problem in the field. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US\$1,000,000 prize for the first correct solution.

The informal term quickly, used above, means the existence of an algorithm for the task that runs in polynomial time. The general class of questions for which some algorithm can provide an answer in polynomial time is called "class P" or just "P". For some questions, there is no known way to find an answer quickly, but if one is provided with information showing what the answer is, it is possible to verify the answer quickly. The class of questions for which an answer can be verified in polynomial time is called NP.

Consider the subset sum problem, an example of a problem that is easy to verify, but whose answer may be difficult to compute. Given a set of integers, does some nonempty subset of them sum to 0? For instance, does a subset of the set {−2, −3, 15, 14, 7, −10} add up to 0? The answer "yes, because the subset {−2, −3, −10, 15} adds up to zero" can be quickly verified with three additions. However, there is no known algorithm to find such a subset in polynomial time (there is one, however, in exponential time, which consists of 2n-n-1 tries), but such an algorithm exists if P = NP; hence this problem is in NP (quickly checkable) but not necessarily in P (quickly solvable).

An answer to the P = NP question would determine whether problems that can be verified in polynomial time, like the subset-sum problem, can also be solved in polynomial time. If it turned out that P ≠ NP, it would mean that there are problems in NP (such as NP-complete problems) that are harder to compute than to verify: they could not be solved in polynomial time, but the answer could be verified in polynomial time.

Aside from being an important problem in computational theory, a proof either way would have profound implications for mathematics, cryptography, algorithm research, artificial intelligence, game theory, multimedia processing, philosophy, economics and many other fields.

Users browsing this topic
Guest

 Forum Jump Welcome - Announcements/Board Rules - Suggestions General Discussions - General Discussions - Business, Sales and Career Tips - Concepts - Community Events - Computer History - News - Fun Stuff Programming - Architecture - Frontend And Backend Development - Graphics/Silverlight / Expression Studio / XAML / AJAX / WPF - SQL Support - Smart Phone IoT, Cloud, Network and Hardware Support - IoT - Internet Of Things - Windows OS Server 2012/2008, Windows 10/8/7 - Cloud Computing - Hardware and Network Support You cannot post new topics in this forum. You cannot reply to topics in this forum. You cannot delete your posts in this forum. You cannot edit your posts in this forum. You cannot create polls in this forum. You cannot vote in polls in this forum.

Main Forum RSS : SoClean Theme Created by Jaben Cargman (Tiny Gecko)