Parameterized Complexity Theory

✍ Scribed by Prof. Dr. Jörg Flum, Prof. Dr. Martin Grohe (auth.)

Publisher: Springer
Year: 2006
Tongue: English
Leaves: 495
Edition: 1
Category: Library

⬇ Acquire This Volume

No coin nor oath required. For personal study only.

✦ Subjects

Algorithms

📜 SIMILAR VOLUMES

Parameterized Complexity Theory

📁 Parameterized Complexity Theory

✍ Jörg Flum, Martin Grohe 📂 Library 📅 2006 🏛 Springer 🌐 English

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

Parameterized Complexity Theory

📁 Parameterized Complexity Theory

✍ Jörg Flum, Martin Grohe 📂 Library 📅 2006 🏛 Springer 🌐 English

Parameterized Complexity Theory

📁 Parameterized Complexity Theory

✍ Jörg Flum, Martin Grohe 📂 Library 📅 2006 🏛 Springer 🌐 English

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

Parameterized Complexity

📁 Parameterized Complexity

✍ Rodney G. Downey, Michael R. Fellows 📂 Library 📅 1999 🏛 Springer 🌐 English

The idea for this book was conceived over the second bottle of Villa Maria's Caber net Medot '89, at the dinner of the Australasian Combinatorics Conference held at Palmerston North, New Zealand in December 1990, where the authors first met and discovered they had a number of interests in common

Fundamentals of Parameterized Complexity

📁 Fundamentals of Parameterized Complexity

✍ Rodney G. Downey, Michael R. Fellows 📂 Library 📅 2013 🏛 Springer 🌐 English

This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizo

Parameterized Complexity in the Polynomi

📁 Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

✍ Ronald de Haan 📂 Library 📅 2019 🏛 Springer Berlin Heidelberg 🌐 English

Parameterized Complexity in the Polynomial Hierarchy was co-recipient of the E.W. Beth Dissertation Prize 2017 for outstanding dissertations in the fields of logic, language, and information. This work extends the theory of parameterized complexity to higher levels of the Polynomial Hierarchy