Feb 26, 2020 · We prove an algorithmic hardness result for finding low-energy states in the so-called continuous random energy model (CREM), introduced by ...

Oct 11, 2018 · Abstract:We prove an algorithmic hardness result for finding low-energy states in the so-called \emph{continuous random energy model (CREM)} ...

We prove an algorithmic hardness result for finding low-energy states in the so-called continuous random energy model (CREM), introduced by Bovier and Kurkova ...

An algorithmic hardness result for finding low-energy states in the so-called CREM, introduced by Bovier and Kurkova in 2004 as an extension of Derrida's ...

We prove an algorithmic hardness result for finding low-energy states in the so-called \emph{continuous random energy model (CREM)}, introduced by Bovier ...

Jul 3, 2019 · The contribution of this work is to explicitly describe the algorithmic threshold for finding low-energy states in the CREM. (equivalently, ...

Abstract: We prove an algorithmic hardness result for finding low-energy states in the so-called continuous random energy model (CREM), introduced by Bovier ...

Oct 15, 2018 · We exhibit a precise and explicit hardness threshold: finding states of energy above the threshold can be done in linear time, while below the ...

Louigi Addario-Berry and Pascal Maillard, The algorithmic hardness threshold for continuous random energy models, Mathematical Statistics and Learning 2 (2020), ...

The continuous random energy model (CREM) is a toy model of disordered systems introduced by Bovier and Kurkova in 2004 based on previous work by Derrida ...