Spara
Parameterized Algorithms
häftad, 2016
Engelska
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.
- Författare
- Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
- Upplaga
- Softcover reprint of the original 1st ed. 2015
- ISBN
- 9783319357027
- Språk
- Engelska
- Vikt
- 310 gram
- Utgivningsdatum
- 2016-10-29
- Sidor
- 613
