(Semi)Algebraic proofs over {±1} variables

DOI10.1145/3357713.3384288OpenAlexW3034785500MaRDI QIDQ5144899

No author found.

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3357713.3384288

zbMATH Keywords

lower boundspolynomial calculusproof complexitysum-of-squaresrandom formulas

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On vanishing sums of roots of unity in polynomial calculus and sum-of-squares

This page was built for publication: (Semi)Algebraic proofs over {±1} variables