(computing theory) , the complexity class of computational problems that a nondeterministic Turing machine can solve in polynomial time.
No comments yet — say something.
Add your own interpretation of "NP".
Viral internet speak — memes, ratios, main-character moments, and the algospeak of every platform from Twitter to Reddit to TikTok comment sections.
See all Internet & Memes slang on Slangora.