Add to ORKGIn classical statistical physics, a phase transition is understood by studying the geometry (the zero-set) of an associated polynomial (the partition function). In this thesis, we will show that one can exploit this notion of phase transitions algorithmically, and conversely exploit the analysis of algorithms to understand phase transitions. As applications, we give efficient deterministic approximation algorithms (FPTAS) for counting $q$-colorings, and for computing the partition function of the Ising model
The phase transition in the number partitioning problem (NPP), i.e., the transition from a region in...
Partition functions arise in combinatorics and related problems of statistical physics as they encod...
We give a polynomial time deterministic approximation algorithm (an FPTAS) for counting the number o...
In classical statistical physics, a phase transition is understood by studying the geometry (the zer...
Spin systems originated in statistical physics as tools for modeling phase transitions in magnets. H...
A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimizat...
We outline a technique for studying phase transition behaviour in computational problems using numbe...
Over the past 30 years, the study of counting problems has become an interesting and important work....
Phase transitions and their associated critical phenomena are of fundamental importance and play a c...
We identify a natural parameter for random number partitioning, and show that there is a rapid trans...
We give the first deterministic fully polynomial-time approximation scheme (FPTAS) for computing the...
Approximate counting via correlation decay is the core algorithmic technique used in the sharp delin...
Approximate counting via correlation decay is the core algorithmic technique used in the sharp delin...
The Ising and $Q$-state Potts models are statistical mechanical models of spins interaction on cryst...
The phase transition in the number partitioning problem (NPP), i.e., the transition from a region in...
The phase transition in the number partitioning problem (NPP), i.e., the transition from a region in...
Partition functions arise in combinatorics and related problems of statistical physics as they encod...
We give a polynomial time deterministic approximation algorithm (an FPTAS) for counting the number o...
In classical statistical physics, a phase transition is understood by studying the geometry (the zer...
Spin systems originated in statistical physics as tools for modeling phase transitions in magnets. H...
A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimizat...
We outline a technique for studying phase transition behaviour in computational problems using numbe...
Over the past 30 years, the study of counting problems has become an interesting and important work....
Phase transitions and their associated critical phenomena are of fundamental importance and play a c...
We identify a natural parameter for random number partitioning, and show that there is a rapid trans...
We give the first deterministic fully polynomial-time approximation scheme (FPTAS) for computing the...
Approximate counting via correlation decay is the core algorithmic technique used in the sharp delin...
Approximate counting via correlation decay is the core algorithmic technique used in the sharp delin...
The Ising and $Q$-state Potts models are statistical mechanical models of spins interaction on cryst...
The phase transition in the number partitioning problem (NPP), i.e., the transition from a region in...
The phase transition in the number partitioning problem (NPP), i.e., the transition from a region in...
Partition functions arise in combinatorics and related problems of statistical physics as they encod...
We give a polynomial time deterministic approximation algorithm (an FPTAS) for counting the number o...