NP-complete

Updated: 04/26/2017 by Computer Hope
Euler diagram of NP-completeness

Alternatively referred to as NP-C or NPC, NP-complete is a classification of problems in computer science that can be verified but not solved by a computer in a reasonable amount of time. The "NP" stands for "non-deterministic polynomial time," and refers how long it would take a computer to verify that the problem is solved.

For example, NP-complete problems are important in cryptography, where it is crucial to know if a password can be guessed given enough time trying random combination of letters and numbers.

Computer Science, NPC, Programming terms