Non-deterministic polynomial time


  • The set of the most difficult problems in Mathematics, solvable in polynomial time only by a [non-deterministic turing machine], but verifiable in polynomial time. In mathematics and computer science is shortened to np. Of course, the editors of UD would rather publish BULLSHIT or several thousand entries for George Bush than something having to do with math. Also, why wont they publish [S4R] is a perfectly acceptable definition.
    [Rule number 5] Rule number 10 guys. Seriously. Im an editor too.


    Non-deterministic polynomial time meaning & definition 1 of Non-deterministic polynomial time.

Similar Words

What is Define Dictionary Meaning?

Define Dictionary Meaning is an easy to use platform where anyone can create and share short informal definition of any word.
Best thing is, its free and you can even contribute without creating an account.



This page shows you usage and meanings of Non-deterministic polynomial time around the world.