(Semi)Algebraic proofs over {±1} variables
Dmitry Sokolov · 2020
One of the major open problems in proof complexity is to prove lower bounds on AC 0[p]-Frege proof systems. As a step toward this goal Impagliazzo, Mouli and Pitassi in a recent paper suggested to prove lower bounds on the size for Polynomial Calculus over the {± 1} basis. In this paper we show a technique for proving such lower bounds and moreover we also give lower bounds on the size for Sum-of-Squares over the {± 1} basis.