13 citations · 59 across the 31 of their papers we have counts for
1 paper · 1 filter
Ran Yaacoby, Nathan Schaar, Leon Kellerhals +3
Finding the ground state of an Ising-spin glass on general graphs belongs to the class of NP-hard problems, widely believed to have no efficient polynomial-time algorithms for solv…