Exact Exponential Algorithms

Exact Exponential Algorithms

Show other versions (1)

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?...

Full description

Bibliographic Details
Main Authors: Fomin, Fedor V. (Author), Kratsch, Dieter (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Series:Texts in Theoretical Computer Science. An EATCS Series,
Subjects:
Mathematics.
Computer programming.
Algorithms.
Mathematical optimization.
Discrete mathematics.
Combinatorics.
Discrete Mathematics.
Optimization.
Programming Techniques.
Algorithm Analysis and Problem Complexity.
Online Access:Full Text via HEAL-Link

Internet

Full Text via HEAL-Link

ΒΚΠ - Πατρα: ALFd

Holdings details from ΒΚΠ - Πατρα: ALFd
Call Number: 330.01 BAU
Copy 1 Available

ΒΚΠ - Πατρα: BSC

Holdings details from ΒΚΠ - Πατρα: BSC
Call Number: 330.01 BAU
Copy 2 Available
Copy 3 Available

Similar Items