1199 search results - page 8 / 240 » Parameterized Proof Complexity |
MFCS
2010
Springer
13 years 7 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
CJ
2008
13 years 8 months ago
2008
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
WG
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...