ISBN: 9783540299523 - parameterized complexity theory (15 risultati)

Condizione: 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. …

Condizione: New.

hardcover. Condizione: New. In shrink wrap. Looks like an interesting title.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New. In English.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Buch. Condizione: 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.…

Condizione: New. pp. xiii + 493.

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 512 pp. Englisch. …

Gebunden. Condizione: 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.…

Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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 KG, Sachsenplatz 4-6, 1201 Wien 512 pp. Englisch. …

Condizione: New. Print on Demand pp. xiii + 493 51 Illus. This item is printed on demand.

Condizione: New. PRINT ON DEMAND pp. xiii + 493.