Parameterized complexity

Known as: FPT (complexity class), Fixed-parameter tractability, W(2)

In computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

Consensus problems for strings and sequences appear in numerous application contexts, ranging from bioinformatics over data…

2018

A vertex cover (VC) of a graph \(G\) is a subset of vertices in \(G\) such that at least one endpoint vertex of each edge in \(G…

2015

Vertex Cover is one of the most well studied problems in the realm of parameterized algorithms and admits a kernel with O(l^2…

2014

We investigate the size of first-order rewritings of conjunctive queries over OWL 2 QL ontologies of depth 1 and 2 by means of…

2014

We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness result holds for a version of the…

2008

For Gauss-Markov processes the asymptotic behaviors of the first passage time probability density functions through certain time…

2004

In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for…

2003

This thesis is presented in two parts. In Part One we concentrate on algorithmic aspects of parameterized complexity. We explore…

1991

We present a functional perturbation theory (FPT) to describe the dynamical behavior of dense, inhomogeneous fluid mixtures, and…

1982