Tipsa dina vänner om produkten:
Parameterized Complexity Theory - Texts in Theoretical Computer Science: an Eatcs Series Jorg Flum 1st Ed. Softcover of Orig. Ed. 2006 edition
Pris
SEK 839
Beställningsvara
Förväntad leverans 7 - 15 jan 2026
Julklappar kan bytas fram till 31:e januari
Lägg till din iMusic-önskelista
eller
Parameterized Complexity Theory - Texts in Theoretical Computer Science: an Eatcs Series
Jorg Flum
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.
508 pages, biography
| Media | Böcker Pocketbok (Bok med mjukt omslag och limmad rygg) |
| Releasedatum | 12 februari 2010 |
| ISBN13 | 9783642067570 |
| Utgivare | Springer-Verlag Berlin and Heidelberg Gm |
| Antal sidor | 508 |
| Mått | 156 × 234 × 26 mm · 707 g |
| Språk | Engelska |