NP-completeness
In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard.
The set of NP-complete problems is often denoted by NP-C or NPC.
The abbreviation NP refers to "nondeterministic polynomial time".
Description
Although any given solution to an NP-complete problem can be verified quickly (in polynomial time), there is no known efficient way to locate a solution in the first place
Indeed, the most notable characteristic of NP-complete problems is that no fast solution to them is known.
That is, the time required to solve the problem using any currently known algorithm increases very quickly as the size of the problem grows.
As a consequence, determining whether or not it is possible to solve these problems quickly, called the P versus NP problem, is one of the principal unsolved problems in computer science today.
While a method for computing the solutions to NP-complete problems using a reasonable amount of time remains undiscovered, computer scientists and programmers still frequently encounter NP-complete problems.
NP-complete problems are often addressed by using heuristic methods and approximation algorithms.
See also
- Algorithm
- Computational complexity theory
- Computer science
- Parallel computation with molecular-motor-propelled agents in nanofabricated networks
- P versus NP problem
External links
- NP-completeness @ Wikipedia
