scientific article
From MaRDI portal
Publication:3549645
zbMath1232.68073MaRDI QIDQ3549645
Leslie Ann Goldberg, Mark R. Jerrum
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph polynomials (05C31) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Complexity of the Bollobás-Riordan Polynomial ⋮ On the Potts model partition function in an external field ⋮ Inapproximability of the Tutte polynomial ⋮ Approximate counting for complex-weighted Boolean constraint satisfaction problems ⋮ A little statistical mechanics for the graph theorist ⋮ Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
This page was built for publication:
