Solve the most difficult computational problems
A book written by Daniel L. Stein & Charles M. Newman
We are explaining the gamification of the Sherrington-Kirkpatrick model.
The defining property of a class of problems that are, informally, "at least as hard as the hardest problems in NP"
Explaining the difference between a P and NP problem
Disorder-free systems that can be described by a periodic Hamiltonian