Exact Exponential Algorithms
by Fedor V. Fomin /
2010 / English / PDF
3.3 MB Download
For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input.
