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?...
Κύριοι συγγραφείς: | Fomin, Fedor V. (Συγγραφέας), Kratsch, Dieter (Συγγραφέας) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2010.
|
Σειρά: | Texts in Theoretical Computer Science. An EATCS Series,
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Digraphs Theory, Algorithms and Applications /
ανά: Bang-Jensen, Jørgen, κ.ά.
Έκδοση: (2009) -
Exact Exponential Algorithms
ανά: Fomin, Fedor V
Έκδοση: (2010) -
Parameterized and Exact Computation 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers /
Έκδοση: (2009) -
Evolutionary Computation in Combinatorial Optimization 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings /
Έκδοση: (2004) -
Recent Advances in Algorithms and Combinatorics
Έκδοση: (2003)