Fine-grained dichotomies for the Tutte plane and Boolean #CSP
From MaRDI portal
Publication:4634392
DOI10.4230/LIPIcs.IPEC.2016.9zbMath1394.68167arXiv1606.06581OpenAlexW2963460324MaRDI QIDQ4634392
Holger Dell, Cornelius Brand, Marc Roth
Publication date: 10 April 2018
Full work available at URL: https://arxiv.org/abs/1606.06581
computational complexityTutte polynomialindependent setsexponential time hypothesisforestscounting problems
Analysis of algorithms and problem complexity (68Q25) Graph polynomials (05C31) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Block interpolation: a framework for tight exponential-time counting complexity ⋮ Parameterized counting of trees, forests and matroid bases ⋮ Unnamed Item
This page was built for publication: Fine-grained dichotomies for the Tutte plane and Boolean #CSP