
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.
- Painos
- 2006 ed.
- ISBN
- 9783540299523
- Kieli
- englanti
- Paino
- 446 grammaa
- Julkaisupäivä
- 9.2.2006
- Sivumäärä
- 495