260 search results - page 10 / 52 » Hardness of Parameterized Resolution |
COCO
2003
Springer
14 years 26 days ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
ERSHOV
2001
Springer
14 years 4 days ago
2001
Springer
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
IFIP
2007
Springer
14 years 1 months ago
2007
Springer
Super-resolution algorithms typically improve the resolution of a video frame by mapping and performing signal processing operations on data from frames immediately preceding and i...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...