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.
Despite the Presburger problem, and in view of intractability, what has been done to establish solutions in reasonable periods of time?
algorithms have been written