Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?

DOI10.1145/3357713.3384245OpenAlexW2989887679MaRDI QIDQ5144897

Iddo Tzameret, Edward A. Hirsch, Yaroslav Alekseev, Dima Yu. Grigoriev

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://arxiv.org/abs/1911.06738

zbMATH Keywords

algebraic complexityproof complexityalgebraic proofssum-of-squares proofstau-conjecturesemi-algebraic proofs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

The power of the binary value principle ⋮ On vanishing sums of roots of unity in polynomial calculus and sum-of-squares ⋮ Propositional proof complexity

This page was built for publication: Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?