MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Fine-grained dichotomies for the Tutte plane and Boolean #CSP

Cornelius Brand
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, MMCI  
AG Audience
English

Date, Time and Location

Tuesday, 2 August 2016
13:00
30 Minutes
E1 4
024
Saarbrücken

Abstract

Jaeger, Vertigan, and Welsh proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: The evaluation is #P-hard almost everywhere, and the remaining points admit polynomial-time algorithms. Dell, Husfeldt, and Wahlén and Husfeldt and Taslaman, in combination with Curticapean, extended the #P-hardness results to tight lower bounds under the counting exponential time hypothesis #ETH, with the exception of the line y=1, which was left open. We complete the dichotomy theorem for the Tutte polynomial under #ETH by proving that the number of all acyclic subgraphs of a given n-vertex graph cannot be determined in time exp(o(n)) unless #ETH fails.

Another dichotomy theorem we strengthen is the one of Creignou and Hermann for counting the number of satisfying assignments to a constraint satisfaction problem instance over the Boolean domain. We prove that all #P-hard cases are also hard under #ETH. The main ingredient is to prove that the number of independent sets in bipartite graphs with n vertices cannot be computed in time exp(o(n)) unless #ETH fails. In order to prove our results, we use the block interpolation idea by Curticapean and transfer it to systems of linear equations that might not directly correspond to interpolation.

joint work with Holger Dell and Marc Roth
http://arxiv.org/abs/1606.06581

Contact

Holger Dell
--email hidden
passcode not visible
logged in users only

Holger Dell, 07/28/2016 14:29
Holger Dell, 07/28/2016 14:28 -- Created document.