What is an example of a problem to which effective algorithms have provided a solution in spite of the intractability associated with the breadth of sizes? [SEP] Similarly, algorithms can solve the NP-complete knapsack problem over a wide range of sizes in less than quadratic time and SAT solvers routinely handle large instances of the NP-complete Boolean satisfiability problem.