nondeterministic polynomial time

noun

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.

Similar
NP time
Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

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

plural nondeterministic polynomial times

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

    Synonyms: NP time

Synonyms & antonyms

nounA 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.

Similar
NP time
Also see
np time
Cite this entry
APA

nondeterministic polynomial time. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/nondeterministic%20polynomial%20time

MLA

“nondeterministic polynomial time.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/nondeterministic%20polynomial%20time. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “nondeterministic polynomial time,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/nondeterministic%20polynomial%20time.

Source: nondeterministic polynomial time on Wiktionary, CC BY-SA 4.0.