text1: How quickly can an algorithm solve an NP-complete knapsack problem?
text2: For example, the decision problem in Presburger arithmetic has been shown not to be in P, yet algorithms have been written that solve the problem in reasonable times in most cases.