Results 41 to 50 of about 149,306 (281)
The Complexity of Reachability in Affine Vector Addition Systems with States [PDF]
Logical Methods in Computer Science, 2021 Vector addition systems with states (VASS) are widely used for the formal verification of concurrent systems. Given their tremendous computational complexity, practical approaches have relied on techniques such as reachability relaxations, e.g., allowing
Michael Blondin, Mikhail Raskin
doaj +1 more source
Parameterized parallel complexity [PDF]
, 1998 We introduce a framework to study the parallel complexity of parameterized problems, and we propose some analogs of NC.
Cesati M., Di Ianni M.
openaire +2 more sources
Treewidth-based algorithms for the small parsimony problem on networks
Algorithms for Molecular Biology, 2022 Background Phylogenetic reconstruction is one of the paramount challenges of contemporary bioinformatics. A subtask of existing tree reconstruction algorithms is modeled by the Small Parsimony problem: given a tree T and an assignment of character-states
Celine Scornavacca, Mathias Weller
doaj +1 more source
Parameterized bounded-depth Frege is not optimal [PDF]
, 2011 A general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [9]. There the authors concentrate on tree-like Parameterized Resolution-a parameterized version of classical Resolution-and their gap complexity ...
A. Haken +17 more
core +8 more sources
Parameterized Complexity of Safe Set [PDF]
Journal of Graph Algorithms and Applications, 2019 In this paper we study the problem of finding a small safe set $S$ in a graph $G$, i.e., a non-empty set of vertices such that no connected component of $G[S]$ is adjacent to a larger component in $G - S$. We enhance our understanding of the problem from the viewpoint of parameterized complexity by showing that (1) the problem is W[2]-hard when ...
Rémy Belmonte +5 more
openaire +2 more sources
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
Algorithms, 2019 Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science.
Robert Ganian, Sebastian Ordyniak
doaj +1 more source
Completeness Results for Parameterized Space Classes
, 2013 The parameterized complexity of a problem is considered "settled" once it has been shown to lie in FPT or to be complete for a class in the W-hierarchy or a similar parameterized hierarchy.
C.M.R. Kintala +10 more
core +1 more source
Parameterized complexity of MaxSat Above Average [PDF]
Theoretical Computer Science, 2012 In MaxSat, we are given a CNF formula $F$ with $n$ variables and $m$ clauses and asked to find a truth assignment satisfying the maximum number of clauses. Let $r_1,..., r_m$ be the number of literals in the clauses of $F$. Then $asat(F)=\sum_{i=1}^m (1-2^{-r_i})$ is the expected number of clauses satisfied by a random truth assignment (the truth ...
Crowston, Robert +4 more
openaire +2 more sources
Parameterized Complexity of Broadcasting in Graphs
Theoretical Computer Science, 2023 The task of the broadcast problem is, given a graph G and a source vertex s, to compute the minimum number of rounds required to disseminate a piece of information from s to all vertices in the graph. It is assumed that, at each round, an informed vertex can transmit the information to at most one of its neighbors.
Fomin, Fedor +2 more
openaire +5 more sources
Algorithms, 2013 We suggest a user-oriented approach to combinatorial data anonymization. A data matrix is called k-anonymous if every row appears at least k times—the goal of the NP-hard k-ANONYMITY problem then is to make a given matrix k-anonymous by suppressing ...
Rolf Niedermeier +2 more
doaj +1 more source