nondeterministic polynomial time

English dictionary entry

Meanings

noun
  1. 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.

Word forms

nondeterministic polynomial time nondeterministic polynomial times

Synonyms

This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.