Articles liés à Parameterized Complexity Theory
Synopsis
Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability.
This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters are each devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic.
The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 72,89
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Parameterized Complexity Theory
Image fournie par le vendeur
Parameterized Complexity Theory
Edité par
Springer Berlin Heidelberg, 2010
ISBN 10 : 3642067573
ISBN 13 : 9783642067570
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The previous definitive book on the area was the Springer title Parameterized Complexity by Downey and Fellows, which is now 6 years old. There are many important new results in the area to introduce and explain, and this new book would replace that ea. N° de réf. du vendeur 5045848
Quantité disponible : Plus de 20 disponibles
Image d'archives
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783642067570_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Parameterized Complexity Theory
Edité par
Springer Berlin Heidelberg, 2010
ISBN 10 : 3642067573
ISBN 13 : 9783642067570
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability.This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters are each devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic.The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity. N° de réf. du vendeur 9783642067570
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Parameterized Complexity Theory
Edité par
Springer Berlin Heidelberg Feb 2010, 2010
ISBN 10 : 3642067573
ISBN 13 : 9783642067570
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book is a state-of-the-art introduction into both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes. It presents detailed proofs of recent advanced results that have not appeared in book form before and replaces the earlier publication 'Parameterized Complexity' by Downey and Fellows as the definitive book on this subject. The book will interest computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity. 512 pp. Englisch. N° de réf. du vendeur 9783642067570
Quantité disponible : 2 disponible(s)
Image d'archives
Parameterized Complexity Theory
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783642067570
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Parameterized Complexity Theory
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Feb 2010, 2010
ISBN 10 : 3642067573
ISBN 13 : 9783642067570
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability.This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters are each devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic.The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 512 pp. Englisch. N° de réf. du vendeur 9783642067570
Quantité disponible : 2 disponible(s)
Image d'archives
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9783642067570
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Parameterized Complexity Theory
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 12688490-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Parameterized Complexity Theory
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 12688490-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Parameterized Complexity Theory
Edité par
Springer, 2010
ISBN 10 : 3642067573
ISBN 13 : 9783642067570
Ancien ou d'occasion
Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 12688490
Quantité disponible : Plus de 20 disponibles