panda
Parameterized complexity theory
Computation by Abstract Devices
Mathematical Logic and Formal Languages
Algorithm Analysis and Problem Complexity
Computational complexity
Information theory
Symbolic and mathematical Logic
Algorithms
Computer software
Computer science
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 …
Read online
Reader not loading? Open it on Archive.org instead.
