The following pages link to Holographic Algorithms (Q3532577):
Displaying 28 items.
- Counting problems in parameterized complexity (Q5009461) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
- (Q5090377) (← links)
- A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation (Q5096443) (← links)
- Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
- Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs (Q5378213) (← links)
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812) (← links)
- Gauging variational inference (Q5854117) (← links)
- Gauges, loops, and polynomials for partition functions of graphical models (Q5857453) (← links)
- Perfect matchings, rank of connection tensors and graph homomorphisms (Q5886319) (← links)
- The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610) (← links)
- Dichotomy result on 3-regular bipartite non-negative functions (Q5918629) (← links)
- Bipartite 3-regular counting problems with mixed signs (Q5918683) (← links)
- Dichotomy result on 3-regular bipartite non-negative functions (Q5925621) (← links)
- Bipartite 3-regular counting problems with mixed signs (Q5925701) (← links)
- Holographic data storage. With a foreword by Alstair M. Glass and Mark J. Cardillo (Q5942399) (← links)
- Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields (Q6053403) (← links)
- Approximability of the complementarily symmetric Holant problems on cubic graphs (Q6076358) (← links)
- Holographic algorithms on domains of general size (Q6109063) (← links)
- A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory (Q6113105) (← links)
- Complexity classification of the eight-vertex model (Q6116195) (← links)
- Undirected determinant and its complexity (Q6166664) (← links)
- The computational complexity of Holant problems on 3-regular graphs (Q6199389) (← links)
- Restricted Holant dichotomy on domains 3 and 4 (Q6606220) (← links)
- A complexity trichotomy for \(k\)-regular asymmetric spin systems with complex edge functions (Q6634373) (← links)
- Restricted Holant dichotomy on domain sizes 3 and 4 (Q6652438) (← links)
- The complexity of ferromagnetic 2-spin systems on bounded degree graphs (Q6664055) (← links)
