Fast Exponential-Time Algorithms to solve NP-complete ... - Lita
Fast Exponential-Time Algorithms to solve NP-complete ... - Lita
Fast Exponential-Time Algorithms to solve NP-complete ... - Lita
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
46/52<strong>Fast</strong> <strong>Exponential</strong>-<strong>Time</strong> <strong>Algorithms</strong>Sort and SearchSort and SearchOld method <strong>to</strong> design exponential-time algorithmsIntroduced by Horowitz, Sahni 1974Typical running time O(2 n/2 ) = O(1.4142 n )