Disordered systems insights on computational hardness
From MaRDI portal
Publication:5055432
Recommendations
- Statistical mechanics methods and phase transitions in optimization problems
- Random instances of problems in NP -- algorithms and statistical physics
- Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem
- scientific article; zbMATH DE number 67483
- Computational complexity, phase transitions, and message-passing for community detection
Cites work
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 5485586 (Why is no real title available?)
- scientific article; zbMATH DE number 7650426 (Why is no real title available?)
- A Limit Theorem for Multidimensional Galton-Watson Processes
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- A Theory of Cooperative Phenomena
- A nearly tight sum-of-squares lower bound for the planted clique problem
- A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian
- An approach to obtaining global extremums in polynomial mathematical programming problems
- An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model
- Analysis of Boolean Functions
- Anneaux preordonnes
- Application of statistical mechanics to NP-complete problems in combinatorial optimisation
- Approximate survey propagation for statistical inference
- Complexity of Positivstellensatz proofs for the knapsack
- Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications
- Determining computational complexity from characteristic ``phase transitions
- Disorder chaos in some diluted spin Glass models
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- Following the Ground States of <scp>Full‐RSB</scp> Spherical Spin Glasses
- Frozen 1-RSB structure of the symmetric Ising perceptron
- Global optimization with polynomials and the problem of moments
- HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Inference in High-Dimensional Linear Regression via Lattice Basis Reduction and Integer Relation Detection
- Lifting sum-of-squares lower bounds: degree-2 to degree-4
- Limits of local algorithms over sparse random graphs
- Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- Lower bounds for subgraph isomorphism
- On a positive semidefinite relaxation of the cut polytope
- On the \(\mathrm{AC}^0\) complexity of subgraph isomorphism
- On the bit complexity of sum-of-squares proofs
- On the energy landscape of spherical spin glasses
- On the solution-space geometry of random constraint satisfaction problems
- On the solution-space geometry of random constraint satisfaction problems
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Optimal errors and phase transitions in high-dimensional generalized linear models
- Optimal shrinkage of eigenvalues in the spiked covariance model
- Optimization of mean-field spin glasses
- Quiet planting in the locked constraint satisfaction problems
- Reducibility among combinatorial problems
- Rounding sum-of-squares relaxations
- SOS is not obviously automatizable, even approximately
- Semidefinite programs on sparse random graphs and their application to community detection
- Sparse Bayesian Methods for Low-Rank Matrix Estimation
- Sparse sums of squares on finite abelian groups and improved semidefinite lifts
- Spectral redemption in clustering sparse networks
- State evolution for general approximate message passing algorithms, with applications to spatial coupling
- Statistical Physics of Spin Glasses and Information Processing
- Storage capacity in symmetric binary perceptrons
- Strongly refuting random CSPs below the spectral threshold
- Suboptimality of local algorithms for a class of max-cut problems
- Sum-of-squares certificates for maxima of random tensors on the sphere
- Sum-of-squares proofs and the quest toward optimal algorithms
- Survey propagation: An algorithm for satisfiability
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- The Lovász theta function for random regular graphs and community detection in the hard regime
- The Parisi formula
- The Parisi ultrametricity conjecture
- The Sherrington-Kirkpatrick model
- The complexity of theorem-proving procedures
- The nature of computation
- The overlap gap property and approximate message passing algorithms for \(p\)-spin models
- The thermodynamic limit in mean field spin glass models
- Universality in polytope phase transitions and message passing algorithms
Cited in
(5)- Statistical mechanics of the maximum-average submatrix problem
- Average-case complexity of tensor decomposition for low-degree polynomials
- Disordered Systems Insights on Computational Hardness
- Counting and hardness-of-finding fixed points in cellular automata on random graphs
- On the free energy of vector spin glasses with nonconvex interactions
This page was built for publication: Disordered systems insights on computational hardness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055432)
