nondeterministic polynomial time
Transcription
-
- US Pronunciation
- US IPA
-
-
- US Pronunciation
- US IPA
-
Definition of nondeterministic polynomial time words
- noun Technical meaning of nondeterministic polynomial time (complexity) (NP) A set or property of computational decision problems solvable by a nondeterministic Turing Machine in a number of steps that is a polynomial function of the size of the input. The word "nondeterministic" suggests a method of generating potential solutions using some form of nondeterminism or "trial and error". This may take exponential time as long as a potential solution can be verified in polynomial time. NP is obviously a superset of P (polynomial time problems solvable by a deterministic Turing Machine in polynomial time) since a deterministic algorithm can be considered as a degenerate form of nondeterministic algorithm. The question then arises: is NP equal to P? I.e. can every problem in NP actually be solved in polynomial time? Everyone's first guess is "no", but no one has managed to prove this; and some very clever people think the answer is "yes". If a problem A is in NP and a polynomial time algorithm for A could also be used to solve problem B in polynomial time, then B is also in NP. See also Co-NP, NP-complete. 1
Information block about the term
Parts of speech for Nondeterministic polynomial time
noun
adjective
verb
adverb
pronoun
preposition
conjunction
determiner
exclamation
See also
Matching words
- Words starting with n
- Words starting with no
- Words starting with non
- Words starting with nond
- Words starting with nonde
- Words starting with nondet
- Words starting with nondete
- Words starting with nondeter
- Words starting with nondeterm
- Words starting with nondetermi
- Words starting with nondetermin
- Words starting with nondetermini
- Words starting with nondeterminis
- Words starting with nondeterminist
Was this page helpful?
Thank you for your feedback! Tell your friends about this page
Tell us why?