Siirry suoraan sisältöön
Parameterized Algorithms
Tallenna

Parameterized Algorithms

Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.

All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students.

Painos
Softcover reprint of the original 1st ed. 2015
ISBN
9783319357027
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
29.10.2016
Sivumäärä
613