In computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according...
18 KB (2,682 words) - 00:58, 21 December 2023
is known that the general graph Steiner tree problem does not have a parameterized algorithm running in 2 ϵ t poly ( n ) {\displaystyle 2^{\epsilon t}{\text{poly}}(n)}...
35 KB (4,351 words) - 06:26, 21 June 2024
Longest path problem (section Parameterized complexity)
fixed-parameter tractable. The longest path problem, parameterized by clique-width, is hard for the parameterized complexity class W [ 1 ] {\displaystyle W[1]} , showing...
22 KB (2,662 words) - 01:59, 2 January 2024
Algorithmic paradigm (section Parameterized complexity)
An algorithmic paradigm or algorithm design paradigm is a generic model or framework which underlies the design of a class of algorithms. An algorithmic...
1 KB (80 words) - 08:18, 27 February 2024
the instance, the number of vertices, or the number of edges. In parameterized complexity, this difference is made explicit by considering pairs ( L , k...
41 KB (4,998 words) - 06:57, 26 June 2024
Dominating set (section Parameterized complexity)
dominating set of size k plays a central role in the theory of parameterized complexity. It is the most well-known problem complete for the class W[2]...
31 KB (4,070 words) - 05:41, 18 July 2024
A parameterized approximation algorithm is a type of algorithm that aims to find approximate solutions to NP-hard optimization problems in polynomial...
28 KB (3,349 words) - 07:21, 24 July 2024
Exponential time hypothesis (redirect from ETH (complexity))
time hypothesis and the parameterized clique problem", in Thilikos, Dimitrios M.; Woeginger, Gerhard J. (eds.), Parameterized and Exact Computation –...
22 KB (3,061 words) - 04:06, 5 April 2024
computational complexity theory. Furthermore, the vertex cover problem is fixed-parameter tractable and a central problem in parameterized complexity theory...
22 KB (2,542 words) - 14:23, 25 May 2024
computability and complexity topics List of unsolved problems in computer science Parameterized complexity Proof complexity Quantum complexity theory Structural...
48 KB (6,302 words) - 10:11, 7 May 2024
Kernelization (category Parameterized complexity)
that cut away parts of the instance that are easy to handle. In parameterized complexity theory, it is often possible to prove that a kernel with guaranteed...
20 KB (2,852 words) - 09:44, 2 June 2024
Clique problem (section Circuit complexity)
no matching algorithm is known for the case of k ≥ 3. Parameterized complexity is the complexity-theoretic study of problems that are naturally equipped...
84 KB (9,876 words) - 00:34, 13 June 2024
In graph theory and theoretical computer science, the monochromatic triangle problem is an algorithmic problem on graphs, in which the goal is to partition...
4 KB (481 words) - 08:23, 6 May 2024
Purohit, N. (2019), "Metric Dimension Parameterized by Treewidth", in Jansen, B. M. P.; Telle, J. A. (eds.), Parameterized and Exact Computation 2019 – IPEC...
20 KB (2,505 words) - 08:05, 16 July 2024
Biclique-free graph (section Parameterized complexity)
incidence problems in discrete geometry, and have also been used in parameterized complexity. According to the Kővári–Sós–Turán theorem, every n-vertex t-biclique-free...
6 KB (712 words) - 11:49, 22 March 2024
computer scientist and graph theorist specializing in parameterized complexity, parameterized algorithms for constraint satisfaction problems, and width...
3 KB (250 words) - 08:47, 24 February 2024
2-satisfiability (section Complexity and extensions)
minimizing the number of true variables, is an important test case for parameterized complexity. A 2-satisfiability problem may be described using a Boolean expression...
64 KB (9,112 words) - 19:20, 13 December 2023
Logic of graphs (section Parameterized complexity)
level of a hierarchy of hard problems from the point of view of parameterized complexity. Therefore, it is unlikely to have a fixed-parameter tractable...
39 KB (4,985 words) - 01:40, 7 November 2023
professional wrestling promotion The computational complexity class W[1] in parameterized complexity The Apple W1 wireless pairing chip primarily used...
1 KB (213 words) - 14:21, 4 August 2021
Circuit rank (section Parametrized complexity)
vertex. Several authors have studied the parameterized complexity of graph algorithms on r-near-trees, parameterized by r {\displaystyle r} . The cycle rank...
13 KB (1,616 words) - 06:56, 3 December 2023
professor at Charles Darwin University, Australia, and Director of the Parameterized Complexity Research Unit (PCRU). He has taught in the United States, Canada...
14 KB (1,630 words) - 05:44, 18 July 2024
Betweenness (section Complexity)
fixed-parameter tractable when parameterized by the difference q − |C|/3 between the solution quality q found by the parameterized algorithm and the |C|/3 quality...
8 KB (966 words) - 22:20, 21 April 2023
touch each other. Treewidth is commonly used as a parameter in the parameterized complexity analysis of graph algorithms. Many algorithms that are NP-hard...
41 KB (4,549 words) - 08:50, 16 July 2024
Arc routing (redirect from Chinese Postman Problem Complexity List)
Gutin, Gregory; Muciaccia, Gabriele; Yeo, Anders (2013-11-18). "Parameterized complexity of k-Chinese Postman Problem". Theoretical Computer Science. 513:...
39 KB (4,730 words) - 07:14, 16 July 2024
scientist, and mathematics educator known for her research in parameterized complexity and her work in mathematics education. She is a professor in the...
7 KB (429 words) - 05:42, 18 July 2024
algorithms Game semantics Generalized game Multiple-agent system Parameterized complexity Process calculi Pi-calculus Hypercomputation Real computation Computable...
5 KB (466 words) - 23:04, 18 April 2024
research on parameterized complexity, mathematical logic, finite model theory, the logic of graphs, database theory, descriptive complexity theory, and...
6 KB (547 words) - 16:43, 17 May 2024
Twin-width (section Parameterized algorithms)
a natural number associated with the graph, used to study the parameterized complexity of graph algorithms. Intuitively, it measures how similar the graph...
33 KB (4,017 words) - 07:37, 22 July 2024
iterative compression, a more general tool for many other parameterized algorithms. The parameterized algorithms known for these problems take nearly-linear...
6 KB (663 words) - 07:39, 18 July 2024
Press, 2014), p. 372. Haan, R. de, Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the...
22 KB (2,767 words) - 08:16, 16 March 2024