scientific article; zbMATH DE number 7204480
From MaRDI portal
Publication:5111358
DOI10.4230/LIPICS.ICALP.2017.28zbMATH Open1441.68180MaRDI QIDQ5111358FDOQ5111358
Leslie Ann Goldberg, Andreas Galanis, D. Štefankovič
Publication date: 27 May 2020
Title of this publication is not available (Why is that?)
Recommendations
- Improved inapproximability results for counting independent sets in the hard-core model
- Computing the independence polynomial: from the tree threshold down to the roots
- Implementations and the independent set polynomial below the Shearer threshold
- Improved inapproximability results for counting independent sets in the hard-core model
- Inapproximability of the independent set polynomial in the complex plane
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)
Cited In (8)
- Implementations and the independent set polynomial below the Shearer threshold
- Title not available (Why is that?)
- Inapproximability of the independent set polynomial in the complex plane
- On a conjecture of Sokal concerning roots of the independence polynomial
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111358)
