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

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