Periodic Reporting for period 2 - CRACKNP (Finding Cracks in the Wall of NP-completeness)

Assuming P does not equal NP, there are no polynomial time algorithms for any NP-complete problem. This however still leaves a huge gap between anything super-polynomial and the exponential run times of trivial exhaustive search. The study of exact (exponential time)...