Abstract
Some of the deepest and most fascinating results of (classical) complexity theory are concerned with counting problems. A parameterized complexity theory of counting problems has only been developed fairly recently and is still in its early stages. This chapter is an introduction into the state of the art of this theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Parameterized Counting Problems. In: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-29953-X_14
Download citation
DOI: https://doi.org/10.1007/3-540-29953-X_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29952-3
Online ISBN: 978-3-540-29953-0
eBook Packages: Computer ScienceComputer Science (R0)