145 search results - page 2 / 29 » Parameterized Complexity Classes under Logical Reductions |
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
RSCTC
2000
Springer
13 years 8 months ago
2000
Springer
The optimization of rough set based classification models with respect to parameterized balance between a model's complexity and confidence is discussed. For this purpose, the...
ECCC
2008
13 years 5 months ago
2008
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as...
IWPEC
2009
Springer
13 years 12 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
ICCAD
2006
IEEE
14 years 2 months ago
2006
IEEE
Process variations in modern VLSI technologies are growing in both magnitude and dimensionality. To assess performance variability, complex simulation and performance models param...