NP

NP
Abbreviation of "non-deterministic polynomial"; the complexity class of computational problems that a non-deterministic Turing machine can solve in polynomial time.
See Also: NP-complete, NP-hard

Wikipedia foundation.

Игры ⚽ Поможем написать курсовую

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”