Explaining NP-complete to even a technically-educated audience is always tricky. Sometimes a somewhat misleading explanation is still going to get them closer to the important bits than a precise technical definition would.

I'd probably write: NP-complete refers to a special class of notoriously difficult problems. A solution to even one of them would lead to a solution to all of them, a development which could have radical real-world implications. (Insert good example here.)