Notes on Parameterized Complexity, Dagstuhl, June 2012.
Notes on Parameterized Complexity, Dagstuhl, June 2012.
Notes on Parameterized Complexity, Dagstuhl, June 2012.
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
GENERIC CASE<br />
◮ Look at algorithms which d<strong>on</strong>’t always halt but if they do<br />
they most be correct. (+coarse variati<strong>on</strong>s)<br />
◮ They are correct a lot:<br />
|{σ | |σ| ≤ n ∧ Φ(σ) ↓}|<br />
lim<br />
n→∞ |Σn → 1.<br />
|<br />
◮ This should happen exp<strong>on</strong>entially fast and and the running<br />
time of Φ should be fast. (eg group theory)<br />
◮ It is more easily applied than things using distributi<strong>on</strong>s and<br />
the like. Borel density is not a measure.