Phase transitions in the complexity of counting
A recent line of works established a remarkable connection for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of approximating the partition function for graphs with maximum degree \Delta undergoes a computational transition that...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
Georgia Institute of Technology
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/52211 |