Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) - Tapa blanda

Flum, J.; Grohe, M.

9783642067570: Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Tapa blanda

ISBN 10: 3642067573 ISBN 13: 9783642067570

Editorial: Springer, 2010

Ver todas las copias de esta edici�n del ISBN

2 Usado

De EUR 100,10

13 Nuevo

De EUR 72,89

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.

Editorial: Springer
A�o de publicaci�n: 2010
Idioma: Ingl�s
ISBN 10: 3642067573
ISBN 13: 9783642067570
Encuadernaci�n: Tapa blanda
N�mero de p�ginas: 512
Contacto del fabricante: no disponible
Persona responsable: CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Comprar usado

Condici�n: Como Nuevo

Unread book in perfect condition...

Ver este art�culo

EUR 100,10

Convertir moneda

EUR 17,08 gastos de env�o desde Estados Unidos de America a Espa�a

Destinos, gastos y plazos de env�o

A�adir al carrito

Comprar nuevo

Ver este art�culo

EUR 72,89

Convertir moneda

EUR 19,49 gastos de env�o desde Alemania a Espa�a

Destinos, gastos y plazos de env�o

A�adir al carrito

Otras ediciones populares con el mismo t�tulo

9783540299523: Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Edici�n Destacada

ISBN 10: 3540299521 ISBN 13: 9783540299523
Editorial: Springer, 2006
Tapa dura

Springer, 2008 (Tapa blanda)

Resultados de la b�squeda para Parameterized Complexity Theory (Texts in Theoretical...

Imagen del vendedor

Parameterized Complexity Theory

J. Flum|M. Grohe

Publicado por Springer Berlin Heidelberg, 2010

ISBN 10: 3642067573 ISBN 13: 9783642067570

Nuevo Tapa blanda

Impresi�n bajo demanda

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: 5045848

Contactar al vendedor

Comprar nuevo

EUR 72,89

Convertir moneda

Gastos de env�o: EUR 19,49

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen de archivo

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Flum, J.; Grohe, M.

Publicado por Springer, 2010

ISBN 10: 3642067573 ISBN 13: 9783642067570

Nuevo Tapa blanda

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: ria9783642067570_new

Contactar al vendedor

Comprar nuevo

EUR 87,44

Convertir moneda

Gastos de env�o: EUR 5,14

De Reino Unido a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

Parameterized Complexity Theory

M. Grohe

Publicado por Springer Berlin Heidelberg Feb 2010, 2010

ISBN 10: 3642067573 ISBN 13: 9783642067570

Nuevo Taschenbuch

Impresi�n bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. 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: 9783642067570

Contactar al vendedor

Comprar nuevo

EUR 85,59

Convertir moneda

Gastos de env�o: EUR 11,00

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 2 disponibles

A�adir al carrito

Imagen del vendedor

Parameterized Complexity Theory

M. Grohe

Publicado por Springer Berlin Heidelberg, 2010

ISBN 10: 3642067573 ISBN 13: 9783642067570

Nuevo Taschenbuch

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. 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: 9783642067570

Contactar al vendedor