The complexity of planar Boolean #CSP with complex weights
- 1 February 2020
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 107, 1-27
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation
This publication has 35 references indexed in Scilit:
- The complexity of weighted Boolean #CSP with mixed signsTheoretical Computer Science, 2009
- The complexity of partition functionsTheoretical Computer Science, 2005
- Expressiveness of matchgatesTheoretical Computer Science, 2002
- A general Lee-Yang theorem for one-component and multicomponent ferromagnetsCommunications in Mathematical Physics, 1981
- The complexity of computing the permanentTheoretical Computer Science, 1979
- The statistics of dimers on a latticePhysica, 1961
- Dimer problem in statistical mechanics-an exact resultPhilosophical Magazine, 1961
- Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising ModelPhysical Review B, 1952
- Statistical Theory of Equations of State and Phase Transitions. I. Theory of CondensationPhysical Review B, 1952
- The Spontaneous Magnetization of a Two-Dimensional Ising ModelPhysical Review B, 1952