Spin Systems on Graphs with Complex Edge Functions and Specified Degree Regularities

DOI10.1007/978-3-642-22685-4_13zbMath1353.68110OpenAlexW2165109358MaRDI QIDQ3087946

Jin-Yi Cai, Michael Kowalczyk

Publication date: 17 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_13

zbMATH Keywords

interpolationcounting complexityholographic algorithmsdichotomy theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Spin systems on \(k\)-regular graphs with complex edge functions ⋮ The complexity of planar Boolean \#CSP with complex weights ⋮ Approximating the partition function of planar two-state spin systems

This page was built for publication: Spin Systems on Graphs with Complex Edge Functions and Specified Degree Regularities