np-complete

N n

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definitions of np-complete word

noun Technical meaning of np-complete (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. 1
adjective np-complete (computing theory) Describing the hardest problems that are in the class NP, and whose solutions can be verified in polynomial time. 0

See all 2 definitions of np-complete

Information block about the term

Parts of speech for Np-complete

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Np-complete

See also

All definitions of np-complete

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?