Parameterized Complexity Theory - Texts in Theoretical Computer Science: an Eatcs Series - Jorg Flum - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783642067570 - 2010. gada 12. februāris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Jorg Flum
Parameterized Complexity Theory - Texts in Theoretical Computer Science: an Eatcs Series 1st Ed. Softcover of Orig. Ed. 2006 edition

Cena
€ 86,49

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 22. - 30. jūl.

Mūsu klienti saka:

14 dienu atgriešanas politika saskaņā ar Eiropas patērētāju tiesību aizsardzības likumu
Top vieta Trustpilot
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

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

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2010. gada 12. februāris
ISBN13 9783642067570
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 508
Izmēri 156 × 234 × 26 mm   ·   707 g
Valoda Angļu  

Vairāk no Jorg Flum

Rādīt visu

Mere med samme udgiver

Skatīt visus Jorg Flum ( piem., Paperback Book )