暂无分享,去创建一个
[1] Eliran Subag. Following the Ground States of Full‐RSB Spherical Spin Glasses , 2018 .
[2] A sequence of approximated solutions to the S-K model for spin glasses , 1987 .
[3] Antonio Auffinger,et al. Universality of Chaos and Ultrametricity in Mixed p‐Spin Models , 2014, 1410.8123.
[4] D. Panchenko. The Sherrington-Kirkpatrick Model , 2013 .
[5] Benjamin Rossman,et al. LOWER BOUNDS FOR SUBGRAPH ISOMORPHISM , 2019, Proceedings of the International Congress of Mathematicians (ICM 2018).
[6] M. Talagrand. The parisi formula , 2006 .
[7] Avishay Tal,et al. Tight bounds on The Fourier Spectrum of AC0 , 2017, Electron. Colloquium Comput. Complex..
[8] Benjamin Rossman,et al. Average-case complexity of detecting cliques , 2010 .
[9] O. Papaspiliopoulos. High-Dimensional Probability: An Introduction with Applications in Data Science , 2020 .
[10] David Gamarnik,et al. Low-Degree Hardness of Random Optimization Problems , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[11] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[12] P. Carmona,et al. Universality in Sherrington–Kirkpatrick's spin glass model , 2004, math/0403359.
[13] Andrea Montanari,et al. Optimization of the Sherrington-Kirkpatrick Hamiltonian , 2018, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[14] F. Guerra,et al. The Thermodynamic Limit in Mean Field Spin Glass Models , 2002, cond-mat/0204280.
[15] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[16] Alexander A. Razborov,et al. On the AC0 Complexity of Subgraph Isomorphism , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[17] Andrea Montanari,et al. Optimization of mean-field spin glasses , 2020, The Annals of Probability.
[18] David Gamarnik,et al. The overlap gap property and approximate message passing algorithms for $p$-spin models , 2019, The Annals of Probability.
[19] Noam Nisan,et al. Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.
[20] T. Sanders,et al. Analysis of Boolean Functions , 2012, ArXiv.
[21] Dmitry Panchenko,et al. Suboptimality of local algorithms for a class of max-cut problems , 2017, The Annals of Probability.
[22] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.
[23] Subhabrata Sen,et al. Optimization on sparse random hypergraphs and spin glasses , 2016, Random Struct. Algorithms.
[24] Optimization of the Sherrington--Kirkpatrick Hamiltonian , 2021 .