nondeterministic polynomial times
nondeterministic polynomial times is the plural of nondeterministic polynomial time.
Meaning of nondeterministic polynomial time
Noun
nondeterministic polynomial time (countable and uncountable, plural nondeterministic polynomial times)
- 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.
- Synonyms:
- NP time
Questions about nondeterministic polynomial times
- What is nondeterministic polynomial times the plural of?
- Nondeterministic polynomial times is the plural of nondeterministic polynomial time.
Words near nondeterministic polynomial times in the dictionary
Source and license
Adapted from Wiktionary: nondeterministic polynomial times (page history and authors); nondeterministic polynomial time (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “nondeterministic polynomial times.” Word.ws, https://word.ws/nondeterministic_polynomial_times. Based on Wiktionary, CC BY-SA 4.0.
