Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft GLS point 1 390 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 790 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Parameterized Complexity Theory

Name: Parameterized Complexity Theory
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 01561383
Price: 46653 HUF
Availability: InStock
Author: Jörg Flum
ISBN: 9783540299523

Jörg Flum

Martin Grohe

Language

English

Book Hardback

Libristo code: 01561383

Publishers Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, February 2006

Parameterized complexity theory is a recent branch of computational complexity theory that provides... Full description

Libristo code: 01561383

318 b

46 653 Ft

In stock at our supplier Shipping in 10-13 days

30-day return policy

Customers also purchased

Essays, Chroniken und andere Schriften Marcel Proust

Hardback

15 742 Ft

Die Heimkehr des träumenden Delphins Sergio Bambaren

Paperback

4 234 Ft

Beiträge zur Geldtheorie und Geldpolitik. Harry G. Johnsen

Paperback

22 703 Ft

WKD 5 Berchtesgardenner Land

Map

6 332 Ft

Ábaco : diarios Francisco León

Paperback

6 757 Ft

Leur Mariee adoree Vanessa Vale

Paperback

5 860 Ft

Bulletin de la Société de géographie commerciale de Paris SOCIETE DE GEOGRAPHIE

Paperback

20 664 Ft

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.