
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.
- Opplag
- 2006 ed.
- ISBN
- 9783540299523
- Språk
- Engelsk
- Vekt
- 446 gram
- Utgivelsesdato
- 9.2.2006
- Antall sider
- 495
