{"total":14,"rows":[{"id":"2205.09727","title":"The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics","created":"2022-05-19","cited_by_count":31,"area":null},{"id":"2206.08756","title":"Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay","created":"2022-06-17","cited_by_count":15,"area":null},{"id":"2109.06915","title":"Reconstruction on Trees and Low-Degree Polynomials","created":"2021-09-14","cited_by_count":10,"area":null},{"id":"2311.03332","title":"Learning Hard-Constrained Models with One Sample","created":"2023-11-06","cited_by_count":7,"area":null},{"id":"2211.05274","title":"Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials","created":"2022-11-10","cited_by_count":6,"area":null},{"id":"2308.15728","title":"Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials","created":"2023-08-30","cited_by_count":6,"area":null},{"id":"2301.11124","title":"SQ Lower Bounds for Random Sparse Planted Vector Problem","created":"2023-01-26","cited_by_count":3,"area":null},{"id":"2502.09832","title":"Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity","created":"2025-02-14","cited_by_count":3,"area":null},{"id":"2603.20589","title":"Generating from Discrete Distributions Using Diffusions: Insights from Random Constraint Satisfaction Problems","created":"2026-03-21","cited_by_count":3,"area":null},{"id":"2212.04016","title":"Quantum-Inspired Approximations to Constraint Satisfaction Problems","created":"2022-12-08","cited_by_count":0,"area":null},{"id":"2411.10453","title":"Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP)","created":"2024-10-31","cited_by_count":0,"area":null},{"id":"2504.03097","title":"A Computational Transition for Detecting Multivariate Shuffled Linear Regression by Low-Degree Polynomials","created":"2025-04-04","cited_by_count":0,"area":null},{"id":"2509.09904","title":"A Smooth Computational Transition in Tensor PCA","created":"2025-09-12","cited_by_count":0,"area":null},{"id":"2604.19712","title":"Ultrametric OGP - parametric RDT \\emph{symmetric} binary perceptron connection","created":"2026-04-21","cited_by_count":0,"area":null}],"next_cursor":null}