Spin systems on k-regular graphs with complex edge functions
From MaRDI portal
(Redirected from Publication:690458)
Spin systems on \(k\)-regular graphs with complex edge functions
Spin systems on \(k\)-regular graphs with complex edge functions
Recommendations
- Spin systems on graphs with complex edge functions and specified degree regularities
- Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions
- A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions
- Holant problems for regular graphs with complex edge functions
- Holant problems for 3-regular graphs with complex edge functions
Cites work
- scientific article; zbMATH DE number 5999552 (Why is no real title available?)
- scientific article; zbMATH DE number 3856167 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1545676 (Why is no real title available?)
- scientific article; zbMATH DE number 5050923 (Why is no real title available?)
- scientific article; zbMATH DE number 3326387 (Why is no real title available?)
- A Complexity Dichotomy for Partition Functions with Mixed Signs
- A computational proof of complexity of some restricted counting problems
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- Beitrag zur Theorie des Ferromagnetismus
- Complexity classifications of Boolean constraint satisfaction problems
- Computational complexity of counting problems on 3-regular planar graphs
- Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
- Dimer problem in statistical mechanics-an exact result
- Graph homomorphisms with complex values: a dichotomy theorem (extended abstract)
- Holant problems and counting CSP
- Holant problems for regular graphs with complex edge functions
- Holographic Algorithms
- Holographic algorithms: from art to science
- On counting homomorphisms to directed acyclic graphs
- On the complexity of \#CSP
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- Spin systems on graphs with complex edge functions and specified degree regularities
- Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
- Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
- The Complexity of Weighted Boolean #CSP
- The Complexity of the Counting Constraint Satisfaction Problem
- The Spontaneous Magnetization of a Two-Dimensional Ising Model
- The complexity of counting in sparse, regular, and planar graphs
- The complexity of partition functions
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Towards a dichotomy theorem for the counting constraint satisfaction problem
Cited in
(12)- A complete dichotomy rises from the capture of vanishing signatures
- A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory
- Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions
- Holographic reduction, interpolation and hardness
- Spin systems on graphs with complex edge functions and specified degree regularities
- FKT is not universal -- a planar holant dichotomy for symmetric constraints
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
- Holant problems for 3-regular graphs with complex edge functions
- A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory
- A complexity trichotomy for \(k\)-regular asymmetric spin systems with complex edge functions
- A collapse theorem for holographic algorithms with matchgates on domain size at most 4
- On the Complexity of Holant Problems
This page was built for publication: Spin systems on \(k\)-regular graphs with complex edge functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690458)
