HomeServicesBlogDictionariesContactSpanish Course
Home › Dictionary › English › nondeterministic polynomial time
← Back to search

Meaning of nondeterministic polynomial time | Babel Free

Noun CEFR C1

Definitions

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.

countable, uncountable

CEFR level

C1
Advanced
This word is part of the CEFR C1 vocabulary — advanced level.
See all C1 English words →

See also

nondeterministic Turing machine nondevelopment nondeviant nondeviation nondeviator nondevice

Learn this word in context

See nondeterministic polynomial time used in real conversations inside our free language course.

Start Free Course

Know this word better than we do? Language is a living thing — help us keep it growing. Collaborate with Babel Free