Garey and Johnson presented more than 300 NP-complete problems in their book Computers and Intractability: A Guide to the Theory of NP-Completeness, and new problems are still being discovered to be within that complexity class.
Гери и Џонсон су представили више од 300 НП-комплетних проблема у својој књизи Computers and Intractability: A Guide to the Theory of NP-Completeness, а и даље се откривају нови проблеми у овој класи комплексности.