1322 search results - page 25 / 265 » Parameterized counting problems |
LATA
2012
Springer
12 years 4 months ago
2012
Springer
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
WG
2009
Springer
14 years 3 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
STOC
1991
ACM
14 years 7 days ago
1991
ACM
d Abstract) James Aspnes Maurice Herlihyy Nir Shavitz Digital Equipment Corporation Cambridge Research Lab CRL 90/11 September 18, 1991 Many fundamental multi-processor coordinati...
CORR
1999
Springer
13 years 8 months 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 ...