
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
- 2006 ed.
- ISBN
- 9783540299523
- Språk
- Engelska
- Vikt
- 446 gram
- Utgivningsdatum
- 2006-02-09
- Sidor
- 495