359 search results - page 14 / 72 » The Parameterized Complexity of Counting Problems |
ACID
2006
13 years 9 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
MST
2007
13 years 7 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
COLT
1993
Springer
13 years 11 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
CDC
2009
IEEE
13 years 8 months ago
2009
IEEE
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...