Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Parameterized Complexity Theory

BuchGebunden
495 Seiten
Englisch
Springererschienen am09.02.2006
Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems.mehr
Verfügbare Formate
BuchGebunden
EUR117,69
BuchKartoniert, Paperback
EUR85,59
E-BookPDF1 - PDF WatermarkE-Book
EUR85,59

Produkt

KlappentextParameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems.
Details
ISBN/GTIN978-3-540-29952-3
ProduktartBuch
EinbandartGebunden
Verlag
Erscheinungsjahr2006
Erscheinungsdatum09.02.2006
Seiten495 Seiten
SpracheEnglisch
Gewicht980 g
IllustrationenXIII, 495 p.
Artikel-Nr.11596371

Inhalt/Kritik

Inhaltsverzeichnis
Fixed-Parameter Tractability.- Reductions and Parameterized Intractability.- The Class W[P].- Logic and Complexity.- Two Fundamental Hierarchies.- The First Level of the Hierarchies.- The W-Hierarchy.- The A-Hierarchy.- Kernelization and Linear Programming Techniques.- The Automata-Theoretic Approach.- Tree Width.- Planarity and Bounded Local Tree Width.- Homomorphisms and Embeddings.- Parameterized Counting Problems.- Bounded Fixed-Parameter Tractability and Limited Nondeterminism.- Subexponential Fixed-Parameter Tractability.mehr
Kritik
From the reviews:



"The book is comprehensive and up-to-date. ... The definitions are illustrated by good examples, the proofs are complete and proceed at a convenient pace, the connections and the implications of the results are spelled out clearly, the exercises are relevant. The book is recommended to specialists as a work of reference, as well as to beginners who want a solid introduction to the theory of parametrized computational problems." (Marius Zimand, Zentralblatt MATH, Vol. 1143, 2008)
mehr

Autor

Prof. Jörg Flum, Abteilung für Mathematische Logik, Albert-Ludwigs-Universität Freiburg, Germany, http://logik.mathematik.uni-freiburg.de/personen/Flum.html Prof. Martin Grohe, Institut für Informatik, Humboldt-Universität zu Berlin, Germany, http://www.informatik.hu-berlin.de/~grohe/The authors are very well qualified to write this book. In addition to their strong backgrounds in complexity, algorithms, etc., they have contributed a number of specific key results in parameterized complexity (e.g., http://epubs.siam.org/sam-bin/dbq/article/42720).Jörg Flum has coauthored two other Springer monographs: (i) "Mathematical Logic", Undergraduate Texts in Mathematics, 0-387-94258-0, 3rd printing since 1994, over 4000 copies sold, Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas, http://www.springer.com/0-387-94258-0. (ii) "Finite Model Theory", Springer Monographs in Mathematics (was in series Perspectives in Mathematical Logic), printed in soft- and hardback, 1995, 2nd ed. in 1999, 2nd corr. print in 2006, Heinz-Dieter Ebbinghaus, Jörg Flum, 3-540-28787-6, http://www.springer.com/3-540-28787-6. In addition, Jörg Flum coauthored the following LNM title: Vol. 769, "Topological Model Theory, 1980, 3-540-09732-5, Jörg Flum, Martin Ziegler. And he coedited the following LNCS title: Vol. 1683, CSL 1999 conf. proc., Jörg Flum, Mario Rodriguez-Artalejo, 1999, 3-540-66536-6.Prof. Martin Grohe has authored over 50 articles for refereed theoretical computer science journals and conference proceedings (http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/g/Grohe:Martin.html) in the areas of logic, complexity, algorithms, etc.
Weitere Artikel von
Grohe, M.