## Improving NP-complete algorithms

Suppose we have an (efficient) NP-complete algorithm. I remind that proving a provable theorem isn’t an NP problem, because there are theorems whose shortest proof is of super-exponential length. However, finding a proof that is below a given “threshold” length is an NP-complete problem. Suppose our NP-complete algorithm is fixed. How to improve it’s ability […]