scientific article; zbMATH DE number 6027241

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitypartition functionshomomorphism functions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

The complexity of weighted Boolean \#CSP with mixed signs ⋮ Classification of a Class of Counting Problems Using Holographic Reductions ⋮ The complexity of weighted and unweighted \(\#\)CSP ⋮ A computational proof of complexity of some restricted counting problems ⋮ The Complexity of Symmetric Boolean Parity Holant Problems

This page was built for publication: