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

Dmitriy Kunisky Xifan Yu

Published in: CoRR (2022)

Keyphrases

lower bound
small number
np hard
similarity measure
scheduling problem
upper bound
worst case
finite number
constant factor