
Parameterized Complexity Theory
Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems.
- Upplaga
- 1st ed. Softcover of orig. ed. 2006
- ISBN
- 9783642067570
- Språk
- Engelska
- Vikt
- 310 gram
- Utgivningsdatum
- 2010-02-12
- Sidor
- 495
