1199 search results - page 39 / 240 » Parameterized Proof Complexity |
130
click to vote
COCO
2004
Springer
15 years 6 months 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...
144
click to vote
MICCAI
2005
Springer
16 years 3 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 ...
121
click to vote
TAMC
2007
Springer
15 years 8 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
15 years 1 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...
134
click to vote
ICCAD
2006
IEEE
15 years 11 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...