Abstract
The behavior of ground state algorithms near phase transitions in random field Ising Magnet (RFIM) and two dimensional spin glass (2DSG) models was analyzed. The two models were examined at zero temperature critical points to determine the time required by polynomial time algorithm to find the ground states. The critical slowing down in polynomial time algorithms was attributed to two fold degeneracy of the ground state in various phases and the divergence of correlation length.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 172021-172024 |
| Number of pages | 4 |
| Journal | Physical Review Letters |
| Volume | 88 |
| Issue number | 1 |
| State | Published - Jan 7 2002 |
ASJC Scopus subject areas
- General Physics and Astronomy