In many publications on the computational complexity of Sum of Squares (SoS) algorithms, it is typical to study the degree-$4$ relaxation; e.g.
I was curious why this number $4$ seems so crucial here. What is the difficulty of higher order SoS relaxations?