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.
This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared...
Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algo...
Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of "Logic and Automata" take the occasion of the sixtieth birthday of Wolfgang Thomas to present a "tour d'horizon" of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field.
Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of "Logic and Automata" tak...
