𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Parameterized Complexity Theory

✍ Scribed by Jârg Flum, Martin Grohe

Publisher
Springer
Year
2006
Tongue
English
Leaves
494
Series
Texts in Theoretical Computer Science. An EATCS Series
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Subjects

ВСория Π°Π»Π³ΠΎΡ€ΠΈΡ‚ΠΌΠΎΠ²

πŸ“œ 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

<P>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

<p>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

<p>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

<p><p>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