Everything about Parameterized complexity
Branch of computational complexity theory
In computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according to their inherent difficulty with respect to multiple parameters of the input or output. The complexity of a problem is then measured as a function of those parameters. Then the theory analyses how the running time for solutions to the problem behave as the parameters get larger. To illustrate the idea, the for a fixed k we can solve instances of vertex cover problem in linear time, whereas the only known algorithms for dominating set problem is more or less search all possible size k subsets and hence require about Ω(n^k) time. When this idea is made formal, the first behaviour is called fixed parameter tractability, since, although both are polynomial time algorithms, the former is of the form O(n^c) independent of the parameter, and the latter is of the form Ω(n^{f ). Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Parameterized complexityA 5-minute orientation
- Skim a recent paper: Hyperparameter Search for Machine Learning Algorithms for Optimizing the Computational ComplexityInfluential work since 2022
- Pick up a classic book: Cognition and IntractabilityThe most-reprinted book on the subject
- Read the landmark paper: AD Model Builder: using automatic differentiation for statistical inference of highly parameterized complex nonlinear modelsCited 1,545 times
- Go sideways: Parameterized approximation algorithmA closely related topic
- Go sideways: KernelizationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
AD Model Builder: using automatic differentiation for statistical inference of highly parameterized complex nonlinear models
Parameterized Complexity and Approximation Algorithms
The Parameterized Complexity of Counting Problems
Parameterized complexity of vertex colouring
Parameterized Complexity of Vertex Cover Variants
Parameterized power domination complexity
Describing parameterized complexity classes
Parameterized Complexity of Eulerian Deletion Problems
🆕 Influential since 2022
Hyperparameter Search for Machine Learning Algorithms for Optimizing the Computational Complexity
Thermal Desorption of Interstellar Ices: A Review on the Controlling Parameters and Their Implications from Snowlines to Chemical Complexity
Integer programming in parameterized complexity: Five miniatures
Parameterized Complexity of Geodetic Set
Parameterized Complexity of Graph Burning
📚 Books worth reading
- 📕Cognition and IntractabilityIris van Rooij, Mark Blokpoel · 2019
Parameterized and Exact ComputationMarek Cygan, Pinar Heggernes · 2014
Experimental AlgorithmsVincenzo Bonifaci · 2013
Advances in Nonlinear Speech ProcessingThomas Drugman · 2013
Advances in 3D geo information systemsPeter van Oosterom · 2008- 📕Parameterized ComplexityRodney G. Downey, M. R. Fellows · 2012
Parameterized Complexity TheoryJ. Flum · 2006- 📕Fundamentals of Parameterized ComplexityRodney G. Downey, Michael R. Fellows · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Parameterized approximation algorithm A parameterized approximation algorithm is a type of algorithm that aims to find approximate solutions to NP-hard optimization problems in polynomial time…
- Kernelization In computer science, a kernelization is a technique for designing efficient algorithms that achieve their efficiency by a preprocessing stage in which…
- Computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource…
- Exponential time hypothesis In computational complexity theory, the exponential time hypothesis (ETH) states that satisfiability of 3-CNF Boolean formulas (3-SAT) cannot be solved…
- Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
- P versus NP problem Unsolved problem in computer science If the solution to a problem can be verified in polynomial time, must the problem be solvable in polynomial time?…
- Boolean circuit In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal…
- Maximum cut In a graph, a maximum cut is a cut whose size is at least the size of any other cut. That is, it is a partition of the graph's vertices into two complementary…