共 50 条
- [1] Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs CONFERENCE ON LEARNING THEORY, VOL 134, 2021, 134 : 410 - 473
- [2] Strongly Refuting Random CSPs Below the Spectral Threshold STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 121 - 131
- [6] Spectral partitioning of random graphs 42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 529 - 537
- [7] OPTIMAL CHEEGER CUTS AND BISECTIONS OF RANDOM GEOMETRIC GRAPHS ANNALS OF APPLIED PROBABILITY, 2020, 30 (03): : 1458 - 1483