Fundamentals of Parameterized Complexity
The field of parameterized complexity/multivariate complexity algorithmics is an exciting and vibrant part of theoretical computer science, responding to the vital need for efficient algorithms in modern society. This comprehensive and self-contained textbook presents an accessible overview of the s...
Main Authors: | Downey, Rodney G. (Author, http://id.loc.gov/vocabulary/relators/aut), Fellows, Michael R. (http://id.loc.gov/vocabulary/relators/aut) |
---|---|
Corporate Author: | SpringerLink (Online service) |
Language: | English |
Published: |
London :
Springer London : Imprint: Springer,
2013.
|
Edition: | 1st ed. 2013. |
Series: | Texts in Computer Science,
|
Subjects: | |
Online Access: | https://doi.org/10.1007/978-1-4471-5559-1 |
Similar Items
-
Complexity and Approximation In Memory of Ker-I Ko / edited by Ding-Zhu Du, Jie Wang.
Published: (2020) -
Limits of Computation From a Programming Perspective / by Bernhard Reus.
by: Reus, Bernhard., et al.
Published: (2016) -
Generalized Rough Sets Hybrid Structure and Applications / by Anjan Mukherjee.
by: Mukherjee, Anjan., et al.
Published: (2015) -
Generalized Network Improvement and Packing Problems by Michael Holzhauser.
by: Holzhauser, Michael., et al.
Published: (2016) -
Logical Foundations of Mathematics and Computational Complexity A Gentle Introduction / by Pavel Pudlák.
by: Pudlák, Pavel., et al.
Published: (2013)