← Jargon

Jargoncomputer science· 4 claims· 3 episodes

NP-hard

A class of problems (like the traveling salesman problem) for which a proposed solution can be verified efficiently but finding one appears intractable; solving one efficiently would solve many optimization problems efficiently.

As defined in 153 | John Preskill on Quantum Computers and What They're Good For


Where it comes up · 3

Most important claims · 4 of 4Search all claims for “NP-hard” →