129 citations · 145 across the 6 of their papers we have counts for
Showing cond-mat.stat-mechShow all
3 papers · 1 filter
cond-mat.stat-mech2005
Renormalization group approach to satisfiability
S. N. Coppersmith
Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists…
cond-mat.stat-mech2003★ 129 cited
Performance Limitations of Flat Histogram Methods and Optimality of Wang-Landau Sampling
P. Dayal, S. Trebst, S. Wessel +4
We determine the optimal scaling of local-update flat-histogram methods with system size by using a perfect flat-histogram scheme based on the exact density of states of 2D Ising m…
cond-mat.stat-mech2003
Dynamics of a Complex Quantum Magnet
J. W. Landry, S. N. Coppersmith
We have computed the low energy quantum states and low frequency dynamical susceptibility of complex quantum spin systems in the limit of strong interactions, obtaining exact resul…