Friday, February 15, 2013
Only Solvable in Exponential Time
What happens if you show one NP-complete problem to be solvable only in exponential time on a Deterministic RAM ?
See Unit 2.5 at Intro to Theoretical Computer Science.
What happens if you show one NP-complete problem to be solvable only in exponential time on a Deterministic RAM ?
See Unit 2.5 at Intro to Theoretical Computer Science.