Semantics of division for polynomial solvers

DOI10.1016/J.JSC.2025.102453MaRDI QIDQ6968351zbMATH OpenFDO

Authors Christopher W. Brown

Publication date 24 June 2025

Published in Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

computer algebracomputational logicreal polynomial constraints

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Logic in computer science (03B70) Computational real algebraic geometry (14Q30)

Cites work

• scientific article; zbMATH DE number 1259143 (Why is no real title available?)
• scientific article; zbMATH DE number 1157658 (Why is no real title available?)
• scientific article; zbMATH DE number 3336816 (Why is no real title available?)
• Curtains in CAD: Why Are They a Problem and How Do We Fix Them?
• Decidability of univariate real algebra with predicates for rational and integer powers
• Elementary Algebraic Specifications of the Rational Complex Numbers
• Hilbert's Tenth Problem is Unsolvable
• Improved projection for cylindrical algebraic decomposition
• Isabelle/HOL. A proof assistant for higher-order logic
• Polynomial constraints and unsat cores in \textsc{Tarski}
• The rational numbers as an abstract data type
• Validity proof of Lazard's method for CAD construction

This page was built for publication: Semantics of division for polynomial solvers

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