Gå direkte til innholdet
Parameterized Complexity Theory
Spar

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.

Forfatter
J. Flum, M. Grohe
Opplag
1st ed. Softcover of orig. ed. 2006
ISBN
9783642067570
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
12.2.2010
Antall sider
495