Definitions
from Wiktionary, Creative Commons Attribution/Share-Alike License.
- adjective computing theory Describing the hardest
problems that are in the classNP , and whosesolutions can beverified inpolynomial time.
Etymologies
Sorry, no etymologies found.
Support
Help support Wordnik (and make this page ad-free) by adopting the word NP-complete.
Examples
-
Slime mold is capable of solving NP-complete graph problems (which I cannot do myself).
Bunny and a Book 2008
-
Slime mold is capable of solving NP-complete graph problems (which I cannot do myself).
Bunny and a Book 2008
-
Computing the conditions for fine tuning based on landscape arguments is likely an NP-complete problem.
If We Live in a Multiverse, How Many Are There? | Universe Today 2009
-
I think porn was proven to be "NP-complete" a while ago.
Porn or Not Dot Com Luis von Ahn 2009
-
What has happened here is that, as computer science tries to understand ai it has realized that many aspects of ai are NP-complete or NP-hard, and a few aspects are not.
-
In the meantime, although the game seems quite stark and simple, it's entirely possible that it's NP-complete.
-
In the meantime, although the game seems quite stark and simple, it's entirely possible that it's NP-complete.
Archive 2008-05-01 2008
-
What has happened here is that, as computer science tries to understand ai it has realized that many aspects of ai are NP-complete or NP-hard, and a few aspects are not.
-
Spooky Computing Quantum computers hold the possibility of solving what computer science calls "NP-complete" problems, the problems that are impossible or nearly impossible to calculate on a classical computer.
The Father of Quantum Computing Quinn Norton 2007
-
Spooky Computing Quantum computers hold the possibility of solving what computer science calls "NP-complete" problems, the problems that are impossible or nearly impossible to calculate on a classical computer.
Comments
Log in or sign up to get involved in the conversation. It's quick and easy.