    Sentence 1: What is the example of  another problem characterized by large  instances that is routinely solved by SAT  handlers employing efficient algorithms?         Sentence 2: larly, 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.    