From the 1 of 1 linked paper with an AI index.
1 paper
Elena Grigorescu, Shreya Nasa, Cameron Seth
The paper presents a new upper bound on the sample complexity for testing whether a q‑uniform hypergraph has an independent set of size ρn, improving previous results by reducing t…