Now showing items 1-2 of 2
Phase transitions in the complexity of counting
(Georgia Institute of Technology, 2014-05-16)
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 ...
The complexity of expansion problems
(Georgia Institute of Technology, 2014-06-26)
Graph-partitioning problems are a central topic of research in the study of algorithms and complexity theory. They are of interest to theoreticians with connections to error correcting codes, sampling algorithms, metric ...