Exact Exponential Algorithms
Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their exponential-time properties vary widely. Why do some NP-hard problems appear to be easier than others?...
| Main Authors: | , |
|---|---|
| Corporate Author: | |
| Format: | Electronic |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2010.
|
| Series: | Texts in Theoretical Computer Science. An EATCS Series,
|
| Subjects: | |
| Online Access: | https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-16533-7 |