9842 search results - page 275 / 1969 » The Complexity of the Matching-Cut Problem |
104
Voted
CORR
1999
Springer
15 years 8 days ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
114
Voted
CADE
2012
Springer
13 years 3 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
95
Voted
WDAG
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
96
Voted
TCS
2010
14 years 11 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
113
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....