Publication:5390002
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2009.1821zbMath1236.68092MaRDI QIDQ5390002
Marc Thurley, Martin Grohe, Leslie Ann Goldberg, Mark R. Jerrum
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_f3c1.html
05C15: Coloring of graphs and hypergraphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Classification of a Class of Counting Problems Using Holographic Reductions, The Complexity of Symmetric Boolean Parity Holant Problems, The complexity of weighted and unweighted \(\#\)CSP, A computational proof of complexity of some restricted counting problems, The complexity of weighted Boolean \#CSP with mixed signs