nondeterministic polynomial time

English Wikipedia - The Free Encyclopedia

Download this dictionary

NP (complexity)

In computational complexity theory, NP is one of the most fundamental complexity classes. The abbreviation NP refers to "nondeterministic polynomial time."

See more at Wikipedia.org...

© This article uses material from Wikipedia^® and is licensed under the GNU Free Documentation License and under the Creative Commons Attribution-ShareAlike License