Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials (Q1690044): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2017.07.061 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793605908 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1607.01167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the partition function for cliques in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating permanents and hafnians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the partition function for graph homomorphisms with multiplicities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The roots of the independence polynomial of a clawfree graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benjamini-Schramm continuity of root moments of graph polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Markov Chains for Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zeros of chromatic and flow polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex zero-free regions at large \(|q|\) for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for Counting Proper Four-Colorings on Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved FPTAS for Multi-spin Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Spencer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for sampling colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting independent sets up to the tree threshold / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2017.07.061 / rank
 
Normal rank

Latest revision as of 03:52, 11 December 2024

scientific article
Language Label Description Also known as
English
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
scientific article

    Statements

    Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials (English)
    0 references
    0 references
    0 references
    18 January 2018
    0 references
    approximation algorithms
    0 references
    independence polynomial
    0 references
    Tutte polynomial
    0 references
    partition function
    0 references
    Holant problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references