Example image of eyePlorer eyePlorer map for 'NP-complete': Complexity class Computational complexity theory NP (complexity) Polynomial time Algorithm Unsolved problems in computer science Computer scientist Programmer Approximation algorithm Decision problem Non-deterministic Turing machine Subset If and only if P (complexity) P versus NP problem Reduction (complexity) Deterministic algorithm Complexity Stephen Cook Computer science Turing machine John Hopcroft Run time (computing) Unsolved problems in mathematics Clay Mathematics Institute Boolean satisfiability problem Cook–Levin theorem Leonid Levin Karp's 21 NP-complete problems Richard Karp David S. Johnson Garey Graph isomorphism Graph isomorphism problem Graph theory Isomorphism Vertex (graph theory) 2-satisfiability NL-complete Planar graph Bipartite graph Cycle graph L (complexity) Knapsack problem Superpolynomial Analysis of algorithms Randomized algorithm Parameterized complexity Heuristic algorithm Metaheuristic