Zero-freeness and approximation of real Boolean Holant problems (Q2143138): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4283163752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflection positivity, rank connectivity, and homomorphism of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing partition functions of the vertex model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing partition functions of the spin model by rank growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the counting constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Dichotomy for the Counting Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Counting CSP with Complex Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete dichotomy rises from the capture of vanishing signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Boolean Holant Problems with Nonnegative Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5002678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Algorithms for the Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting independent sets up to the tree threshold / 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: Zeros of ferromagnetic 2-spin systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zeros of Holant problems: locations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Switch Markov Chain for Perfect Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting perfect matchings in general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple FPTAS for Counting Edge Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPTAS for Weighted Fibonacci Gates and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation Decay up to Uniqueness in Spin Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of approximating bounded-degree Boolean \(\#\)CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating partition functions of the two-state spin system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the permanent of (some) complex matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and complexity of partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorems on the Partition Functions of the Heisenberg Ferromagnets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting unbranched subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of zeros for the partition function of the Ising model on bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative complexity of approximate counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zeros of graph-counting polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fisher Zeros and Correlation Decay in the Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Holant Problems / rank
 
Normal rank

Latest revision as of 03:06, 29 July 2024

scientific article
Language Label Description Also known as
English
Zero-freeness and approximation of real Boolean Holant problems
scientific article

    Statements

    Zero-freeness and approximation of real Boolean Holant problems (English)
    0 references
    0 references
    0 references
    0 references
    31 May 2022
    0 references
    approximate counting
    0 references
    zeros
    0 references
    Holant problems
    0 references
    holographic transformation
    0 references
    FPTAS
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers