Common · Knowledge
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.
From Wikipedia
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. This allows the classification of NP-hard problems on a finer scale than in the classical setting, where the complexity of a problem is only measured as a function of the number of bits in the input. This appears to have been first demonstrated in Gurevich, Stockmeyer & Vishkin (1984). The first systematic work on parameterized complexity was done by Downey & Fellows (1999). The existence of efficient, exact, and deterministic solving algorithms for NP-complete, or otherwise NP-hard, problems is considered unlikely, if input parameters are not fixed; all known solving algorithms for these problems require time that is exponential (so in particular super-polynomial) in the total size of the input. However, some problems can be solved by algorithms that are exponential only in the size of a fixed parameter while polynomial in the size of the input. Under the assumption that P ≠ NP, there exist many natural problems that require super-polynomial running time when complexity is measured in terms of the input size only but that are computable in a time that is polynomial in the input size and exponential or worse in a parameter k. Hence, if k is fixed at a small value and the growth of the function over k is relatively small then such problems can still be considered "tractable" despite their traditional classification as "intractable". Such an algorithm is called a fixed-parameter tractable (FPT) algorithm, because the problem can be solved efficiently (i.e., in polynomial time) for constant values of the fixed parameter. A parameterized problem that...
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
★
♯P
Set of the counting problems associated with the decision problems in the set NP
-
C★★★
Computational complexity
Measure of the amount of resources needed to run an algorithm or solve a computational problem
-
P★★
P (complexity)
Computational complexity class of problems
-
C★
Computability
Ability to solve a problem in an effective manner
-
C★
Co-NP
Complexity class
-
M★★
Multi-paradigm programming language
Programming language type
-
★★
Economic Complexity Index
Holistic measure of the productive capabilities of large economic systems
-
E★
E (complexity)
Complexity class
-
T★★★
Turing completeness
Ability of a computing system to simulate Turing machines
-
S★
Space complexity
Amount of memory space that an algorithm uses as a function of the input's size
-
★
PP (complexity)
Complexity class
-
★
Undecidable problem
Decision problem for which it is impossible to construct an algorithm that always leads to a correct yes-or-no answer
-
★★★
NP (complexity)
Computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time
-
★★★
Theory of computation
Subfield of computer science
-
★★
L (complexity)
Complexity class (logarithmic space)
-
P★
PCP theorem
Theorem in complexity theory that every problem in NP has probabilistically checkable proofs
-
P★★★
Perplexity
The exponentiation of the information entropy
-
★★
Memory hierarchy
Computer architecture that classifies memory/storage into a hierarchy based on response time