A degree 4 sum-of-squares lower bound for the clique number of the Paley graph

DOI10.4230/LIPICS.CCC.2023.30MaRDI QIDQ6640367zbMATH OpenFDO

Authors Dmitriy Kunisky, Xifan Yu

Publication date 19 November 2024

zbMATH Keywords

convex optimizationderandomizationPaley graphsum of squares

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: A degree 4 sum-of-squares lower bound for the clique number of the Paley graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640367)