No article text was recorded for this version.
algorithmic certification limits
Version 1 of 110 papers19 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes
- Blog: Sum of Squares Lower Bounds from Pairwise Independence
- Blog: Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique
- Blog: Majority is stablest: discrete and SoS
- Blog: Sum-of-Squares Lower Bounds for Sparse Independent Set
- Blog: Sum-of-squares lower bounds for Non-Gaussian Component Analysis
- Blog: Spectral Refutations of Semirandom k-LIN over Larger Fields
- Blog: A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian
- Blog: Sum-of-Squares Lower Bounds for Densest k-Subgraph
- Blog: Disordered Systems Insights on Computational Hardness
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_algorithmic_certification_limits_a486a1a0,
title = {algorithmic certification limits},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/algorithmic-certification-limits/rdr_a486a1a0bb21477c88b169981b574b73},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_algorithmic_certification_limits_a486a1a0_v1,
title = {algorithmic certification limits},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/algorithmic-certification-limits/rdr_a486a1a0bb21477c88b169981b574b73/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}