nondeterministic polynomial time

English

Noun

nondeterministic polynomial time (countable and uncountable, plural nondeterministic polynomial times)

  1. (computer science) A class of decision problems for which a yes solution can be verified by a deterministic Turing machine in polynomial time, or alternatively a set of problems that can be solved in polynomial time by a nondeterministic Turing machine.
    Synonym: NP time
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.