On using bi-equational constraints in CAD construction

DOI10.1145/1073884.1073897zbMath1360.68925OpenAlexW2003425586MaRDI QIDQ5262745

Christopher W. Brown, Scott McCallum

Publication date: 16 July 2015

Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073884.1073897

zbMATH Keywords

polynomial systemsCAD

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (9)

CAD and topology of semi-algebraic sets ⋮ Cylindrical algebraic sub-decompositions ⋮ Testing elementary function identities using CAD ⋮ Validity proof of Lazard's method for CAD construction ⋮ Properness defects of projection and minimal discriminant variety ⋮ Truth table invariant cylindrical algebraic decomposition ⋮ Cylindrical algebraic decomposition with equational constraints ⋮ Combining logical and algebraic techniques for natural style proving in elementary analysis ⋮ Special algorithm for stability analysis of multistable biological regulatory systems

This page was built for publication: On using bi-equational constraints in CAD construction