Cita APA (7a ed.)

Cheairi, H. E., & Gamarnik, D. (2024). Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs.

Cita Chicago Style (17a ed.)

Cheairi, Houssam El, y David Gamarnik. Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs. 2024.

Cita MLA (9a ed.)

Cheairi, Houssam El, y David Gamarnik. Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs. 2024.