We study the algorithmic task of finding a large independent set in sparse Erdős– Rényi random graph with $n$ vertices and average degree $d$. The maximum is known to have size $(2 \log d / d)n$ double limit $n \to \infty$ followed by $d \infty$, but best polynomial-time algorithms can only find an half-optimal $(\log d)n$. show that class low-degree polynomial sets no larger, improving upon re...