This project is to find whether the Np-complete problem can be solved in subexponential time and if it is, what the best possible value of a is for the exponential running time of order Oan.
Supervisor: Dr. Walter Kern, Universiteit Twente.