<span class="searchmatch">nondeterministic</span> <span class="searchmatch">polynomial</span> <span class="searchmatch">time</span> (countable and uncountable, plural <span class="searchmatch">nondeterministic</span> <span class="searchmatch">polynomial</span> times) (computer science) A class of decision problems...
<span class="searchmatch">nondeterministic</span> <span class="searchmatch">polynomial</span> times plural of <span class="searchmatch">nondeterministic</span> <span class="searchmatch">polynomial</span> <span class="searchmatch">time</span>...
NP <span class="searchmatch">time</span> Synonym of <span class="searchmatch">nondeterministic</span> <span class="searchmatch">polynomial</span> <span class="searchmatch">time</span>....
where the runtime can be bounded (from above) by a <span class="searchmatch">polynomial</span> in the input size. <span class="searchmatch">nondeterministic</span> <span class="searchmatch">polynomial</span> <span class="searchmatch">time</span> randomized <span class="searchmatch">polynomial</span> <span class="searchmatch">time</span> Translations...
property, of a problem with a yes/no answer in which the complementary yes/no problem calls for <span class="searchmatch">nondeterministic</span> <span class="searchmatch">polynomial</span> <span class="searchmatch">time</span>. Synonym: co-NP (initialism)...
representation, and as algorithms. complementary <span class="searchmatch">nondeterministic</span> <span class="searchmatch">polynomial</span> <span class="searchmatch">nondeterministic</span> <span class="searchmatch">polynomial</span> <span class="searchmatch">time</span> <span class="searchmatch">nondeterministic</span> Turing machine NP involving choices...
complementary <span class="searchmatch">nondeterministic</span> <span class="searchmatch">polynomial</span> Conway-Alexander <span class="searchmatch">polynomial</span> Conway <span class="searchmatch">polynomial</span> cyclotomic <span class="searchmatch">polynomial</span> Dickson <span class="searchmatch">polynomial</span> elementary symmetric <span class="searchmatch">polynomial</span> Fibonacci...
of <span class="searchmatch">nondeterministic</span> <span class="searchmatch">polynomial</span>, the complexity class of computational problems that a <span class="searchmatch">nondeterministic</span> Turing machine can solve in <span class="searchmatch">polynomial</span> <span class="searchmatch">time</span>. 2017...
by a (deterministic) Turing machine in <span class="searchmatch">polynomial</span> <span class="searchmatch">time</span>. (physics, of a system) Having exactly predictable <span class="searchmatch">time</span> evolution. (computing, of an algorithm)...
non-Archimedean time <span class="searchmatch">nondeterministic</span> <span class="searchmatch">polynomial</span> <span class="searchmatch">time</span> nonuniform <span class="searchmatch">polynomial</span> <span class="searchmatch">time</span> noontime normal <span class="searchmatch">time</span> NP <span class="searchmatch">time</span> NTIME occurrence <span class="searchmatch">time</span> offset <span class="searchmatch">time</span> off <span class="searchmatch">time</span> ofttimes...