scientific article; zbMATH DE number 7204480

DOI10.4230/LIPIcs.ICALP.2017.28zbMath1441.68180MaRDI QIDQ5111358

Leslie Ann Goldberg, Andreas Galanis, Daniel Štefanković

Publication date: 27 May 2020

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

zbMATH Keywords

approximate countingindependent set polynomialShearer threshold

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (7)

A Spectral Independence View on Hard Spheres via Block Dynamics ⋮ Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials ⋮ Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials ⋮ Inapproximability of the Independent Set Polynomial in the Complex Plane ⋮ Unnamed Item ⋮ On a conjecture of Sokal concerning roots of the independence polynomial ⋮ Implementations and the independent set polynomial below the Shearer threshold

This page was built for publication: