1199 search results - page 39 / 240 » Parameterized Proof Complexity |
COCO
2004
Springer
14 years 12 days ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
MICCAI
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. We develop a general approach that uses holomorphic 1forms to parameterize anatomical surfaces with complex (possibly branching) topology. Rather than evolve the surface ...
TAMC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
ECCC
2010
13 years 7 months ago
2010
We initiate the study of the proof complexity of propositional encoding of (weak cases of) concrete independence results. In particular we study the proof complexity of Paris-Harr...
ICCAD
2006
IEEE
14 years 5 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...