
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
- 1st ed. Softcover of orig. ed. 2006
- ISBN
- 9783642067570
- Kieli
- englanti
- Paino
- 310 grammaa
- Julkaisupäivä
- 12.2.2010
- Sivumäärä
- 495