Sciweavers

34 search results - page 1 / 7
» On Miniaturized Problems in Parameterized Complexity Theory
Sort
View
71
Voted
IWPEC
2004
Springer
15 years 2 months ago
On Miniaturized Problems in Parameterized Complexity Theory
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
Yijia Chen, Jörg Flum
CSL
2007
Springer
15 years 3 months ago
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
Yijia Chen, Jörg Flum
COCO
2006
Springer
65views Algorithms» more  COCO 2006»
15 years 1 months ago
An Isomorphism between Subexponential and Parameterized Complexity Theory
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
Yijia Chen, Martin Grohe
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
15 years 2 months ago
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
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 ...
Yijia Chen, Jörg Flum, Martin Grohe
ATAL
2009
Springer
15 years 4 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus