Artículos relacionados a Parameterized Complexity Theory (Texts in Theoretical...
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) - Tapa dura
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Críticas
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)
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 98,54
EUR 19,49 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Parameterized Complexity Theory (Texts in Theoretical...
Imagen de archivo
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Librería: Anybook.com, Lincoln, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1050grams, ISBN:9783540299523. Nº de ref. del artículo: 5806544
Cantidad disponible: 1 disponibles
Imagen del vendedor
Parameterized Complexity Theory
Publicado por
Springer Berlin Heidelberg, 2006
ISBN 10: 3540299521
ISBN 13: 9783540299523
Nuevo
Tapa dura
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: 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 ref. del artículo: 180331002
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Parameterized Complexity Theory
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 4202410-n
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Parameterized Complexity Theory
Publicado por
Springer Berlin Heidelberg Feb 2006, 2006
ISBN 10: 3540299521
ISBN 13: 9783540299523
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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 ref. del artículo: 9783540299523
Cantidad disponible: 2 disponibles
Imagen del vendedor
Parameterized Complexity Theory
Publicado por
Springer Berlin Heidelberg, 2006
ISBN 10: 3540299521
ISBN 13: 9783540299523
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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 ref. del artículo: 9783540299523
Cantidad disponible: 1 disponibles
Imagen de archivo
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Librería: Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9783540299523
Cantidad disponible: 2 disponibles
Imagen de archivo
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Librería: California Books, Miami, FL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: I-9783540299523
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540299523_new
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Parameterized Complexity Theory
Publicado por
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 2006
ISBN 10: 3540299521
ISBN 13: 9783540299523
Nuevo
Tapa dura
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Parameterized complexity theory is a branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. This book presents an introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes. Series: Texts in Theoretical Computer Science: An EATCS Series. Num Pages: 495 pages, 51 black & white illustrations. BIC Classification: PBCD; UYF. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 30. Weight in Grams: 980. . 2006. Hardback. . . . . Nº de ref. del artículo: V9783540299523
Cantidad disponible: 15 disponibles
Imagen del vendedor
Parameterized Complexity Theory
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 4202410-n
Cantidad disponible: Más de 20 disponibles