Abstract
We devise a framework for proving tight lower bounds under the counting exponential-time hypothesis #ETH introduced by Dell et al. Our framework allows to convert many known #P-hardness results for counting problems into results of the following type: If the given problem admits an algorithm with running time 2o(n) on graphs with n vertices and O(n) edges, then #ETH fails. As exemplary applications of this framework, we obtain such tight lower bounds for the evaluation of the zero-one permanent, the matching polynomial, and the Tutte polynomial on all non-easy points except for two lines.
Cite
CITATION STYLE
Curticapean, R. (2015). Block interpolation: A framework for tight exponential-time counting complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9134, pp. 380–392). Springer Verlag. https://doi.org/10.1007/978-3-662-47672-7_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
