359 search results - page 19 / 72 » The Parameterized Complexity of Counting Problems |
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
ECCC
2007
13 years 7 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
CPM
2005
Springer
14 years 1 months ago
2005
Springer
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
MST
2007
13 years 7 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
FOCS
2003
IEEE
14 years 25 days ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...