PARAMETERIZED COMPLEXITY THEORY—A PRIMER
PARAMETERIZED COMPLEXITY THEORY—A PRIMER
This chapter introduces basic concepts which are necessary for an understanding of this subject, beginning with a close look at parameterized algorithmics. It briefly highlights the central aspects of the theory, defining parameterized problems, fixed-parameter tractability, parameterized reductions, and the parameterized complexity class W[1] representing parameterized hardness. In addition, it also indicates the limitations of the theory, focussing on different sorts of combinatorial explosions.
Keywords: parameterized problem, fixed-parameter tractable, parameterized reduction, W[1] and parameterized hardness, combinatorial explosion, fixed parameter algorithmics
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .
