nondeterministic polynomial times

A form of nondeterministic polynomial time — 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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

noun
  1. pluralplural of nondeterministic polynomial time
Cite this entry
APA

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

MLA

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

Chicago

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

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