First-order reasoning and efficient semi-algebraic proofs

DOI10.1109/LICS52264.2021.9470546MaRDI QIDQ6651968zbMATH OpenFDO

Authors

Publication date 11 December 2024

Mathematics Subject Classification ID

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

Recommendations

• Semialgebraic Proofs and Efficient Algorithm Design
• scientific article; zbMATH DE number 2086627
• scientific article; zbMATH DE number 2086404
• scientific article; zbMATH DE number 1916823
• The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6651968)