Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative?

DOI10.1137/20m1374523MaRDI QIDQ6562829

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

Publication date: 27 June 2024

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

proof complexityalgebraic circuit complexitysemialgebraic proofs

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

This page was built for publication: Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative?