1199 search results - page 3 / 240 » Parameterized Proof Complexity |
FSTTCS
2009
Springer
14 years 25 days ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
ECOOP
2006
Springer
13 years 10 months ago
2006
Springer
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...
CSL
2007
Springer
14 years 13 days ago
2007
Springer
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
SIGMOD
2002
ACM
14 years 6 months ago
2002
ACM
CORR
2007
Springer
13 years 6 months ago
2007
Springer
We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin exte...