NP-Complete
Updated: 04/26/2017 by Computer Hope
Alternatively called NP-C or NPC, NP-Complete is a classification of problems in computer science. NP-complete problems are verified but not solved by a computer in a reasonable time. The "NP" stands for "non-deterministic polynomial time" and refers to how long a computer would take to verify the problem is solved.
For example, NP-complete problems are important in cryptography, where it's crucial to know if a password can be guessed given enough time trying a random combination of letters and numbers.