Dictionary    Maps    Thesaurus    Translate    Advanced >   


Tip: Click Thesaurus above for synonyms. Also, follow synonym links within the dictionary to find definitions from other sources.

1. The Free On-line Dictionary of Computing (30 December 2018)
NP-complete

    (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)


Common Misspellings >
Most Popular Searches: Define Misanthrope, Define Pulchritudinous, Define Happy, Define Veracity, Define Cornucopia, Define Almuerzo, Define Atresic, Define URL, Definitions Of Words, Definition Of Get Up, Definition Of Quid Pro Quo, Definition Of Irreconcilable Differences, Definition Of Word, Synonyms of Repetitive, Synonym Dictionary, Synonym Antonyms. See our main index and map index for more details.

©2011-2024 ZebraWords.com - Define Yourself - The Search for Meanings and Meaning Means I Mean. All content subject to terms and conditions as set out here. Contact Us, peruse our Privacy Policy