Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2004.12063
Cited By
v1
v2 (latest)
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics
25 April 2020
D. Gamarnik
Aukosh Jagannath
Alexander S. Wein
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics"
6 / 6 papers shown
The Algorithmic Phase Transition in Correlated Spiked Models
Zhangsong Li
367
0
0
08 Nov 2025
Binary perceptron computational gap -- a parametric fl RDT view
Mihailo Stojnic
127
2
0
02 Nov 2025
Are Neural Networks Collision Resistant?
IACR Cryptology ePrint Archive (IACR ePrint), 2025
Marco Benedetti
Andrej Bogdanov
Enrico M. Malatesta
Marc Mézard
Gianmarco Perrupato
Alon Rosen
Nikolaj I. Schwartzbach
R. Zecchina
171
1
0
24 Sep 2025
A Smooth Computational Transition in Tensor PCA
Zhangsong Li
165
1
0
12 Sep 2025
Low degree conjecture implies sharp computational thresholds in stochastic block model
Jingqiu Ding
Yiding Hua
Lucas Slot
David Steurer
491
6
0
20 Feb 2025
Tensor cumulants for statistical inference on invariant distributions
Dmitriy Kunisky
Cristopher Moore
Alexander S. Wein
257
22
0
29 Apr 2024
1
Page 1 of 1
