BOOK-CHAPTER
PARAMETERIZED COMPLEXITY THEORY
Abstract
Abstract This chapter offers a closer look at parameterized computational complexity theory. Central concepts in this context are parameterized problems, parameterized reducibility, parameterized complexity classes, W[1], complete problems, and W[1]-hardness proofs. In addition, the chapter provides a survey of some recent developments concerning structural parameterized complexity theory.
Keywords:
Parameterized complexity Mathematical proof Context (archaeology) Computer science Computational complexity theory Theoretical computer science Mathematics Algorithm Geography Geometry
Metrics
575
Cited By
40.27
FWCI (Field Weighted Citation Impact)
164
Refs
1.00
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
semigroups and automata theory
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
BOOK-CHAPTER
Parameterized Complexity Theory
Lecture notes in computer science Year: 2019 Pages: 33-41
JOURNAL ARTICLE
Parameterized complexity of discrete morse theory
Benjamin A. BurtonThomas LewinerJoão PaixãoJonathan Spreer
Year: 2013 Pages: 127-136