Parameterized complexity theory is a branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. This book provides an introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes. more...

Presents the main results of descriptive complexity theory - the connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. This book also looks at important logic in this context, which include fixed-point logic, transitive closure logic, and certain infinitary languages. more...