Next You can't get there from here 17

NP-complete

        Bin packing
        Clique                  
        Dominating set
        Exact cover by 3-sets
        Graph 3-colorability
        Hamiltonian cycle
        Integer linear programming
        Longest path
        Minimum broadcast time
        Minimum cover
        Multiprocessor scheduling
        Partition               
        Partition into cliques
        Precedence-constrained scheduling
        Regex matching with backreferences
        Satisfiability
        Subgraph isomorphism
        Subset-sum
        3-dimensional matching
        Travelling salesman
        Vertex cover
        ... (hundreds more) ...

Next Copyright © 2005 M. J. Dominus