Optimal low-degree hardness of maximum independent set
Mathematical Statistics and Learning · 2022
DOI: 10.4171/msl/25 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Statistics and Learning, 2022. Verfasst von Alexander S. Wein. Die Arbeit wurde bisher 27-mal zitiert (Crossref).
Abstract (Originalsprache)
We study the algorithmic task of finding a large independent set in a sparse Erdős– Rényi random graph with n vertices and average degree d . The maximum independent set is known to have size (2 \log d / d)n in the double limit n \to \infty followed by d \to \infty , but the best known polynomial-time algorithms can only find an independent set of half-optimal size (\log d / d)n . We show that the class of low-degree polynomial algorithms can find independent sets of half-optimal size but no larger, improving upon a result of Gamarnik, Jagannath, and the author. This generalizes earlier work by Rahman and Virág, which proved the analogous result for the weaker class of local algorithms .
Zitieren
APA
Wein, A. S. (2022). Optimal low-degree hardness of maximum independent set. Mathematical Statistics and Learning. https://doi.org/10.4171/msl/25
Vancouver
Wein AS. Optimal low-degree hardness of maximum independent set. Mathematical Statistics and Learning. 2022. doi:10.4171/msl/25
BibTeX
@article{Wein2022,
author = {Wein, Alexander S.},
title = {Optimal low-degree hardness of maximum independent set},
journal = {Mathematical Statistics and Learning},
year = {2022},
doi = {10.4171/msl/25}
}
EUVIMED