Parameterized Complexity Theory by Jörg Flum
English | PDF | 2006 | 495 Pages | ISBN : 3540299521 | 4.2 MB
Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability.