Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs

MLA

Cheairi, Houssam El, and David Gamarnik. Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs. 2024. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2412.18014&authtype=sso&custid=ns315887.

APA

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

Chicago

Cheairi, Houssam El, and David Gamarnik. 2024. “Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2412.18014&authtype=sso&custid=ns315887.