follow Dictionary.com

Your favorite word could be our Word of the Day!

np-complete

np-complete in Technology
complexity
(NPC, Nondeterministic Polynomial time complete) A set or property of computational decision problems which is a subset of NP (i.e. can be solved by a nondeterministic Turing Machine in polynomial time), with the additional property that it is also NP-hard. Thus a solution for one NP-complete problem would solve all problems in NP. Many (but not all) naturally arising problems in class NP are in fact NP-complete.
There is always a polynomial-time algorithm for transforming an instance of any NP-complete problem into an instance of any other NP-complete problem. So if you could solve one you could solve any other by transforming it to the solved one.
The first problem ever shown to be NP-complete was the satisfiability problem. Another example is Hamilton's problem.
See also computational complexity, halting problem, Co-NP, NP-hard.
(http://fi-www.arc.nasa.gov/fia/projects/bayes-group/group/NP/).
[Other examples?]
(1995-04-10)
The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source

Word of the Day

Word Value for np

0
0
Scrabble Words With Friends

Quotes with np-complete

Nearby words for np-complete