First-order reasoning and efficient semi-algebraic proofs

DOI10.1016/j.apal.2024.103496MaRDI QIDQ6614038

Iddo Tzameret, Fedor Part, Neil Thapen

Publication date: 7 October 2024

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

bounded arithmeticpolynomial calculussum of squaressemi-algebraic proofs

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)

This page was built for publication: First-order reasoning and efficient semi-algebraic proofs