Fast algorithms for solving systems of polynomial constraints over the reals

إصدارات 2026-2027

• 2027
  • J. Elliott, M. Giesbrecht, E. Gillot, M. Safey El Din, E. Schost : “Refined bit complexity for the computation of at least one point per connected component of a smooth complete intersection real algebraic set”, Journal of Symbolic Computation, vol. 138, pp. 102602, (Elsevier) (2027)
• 2026
  • J. Berthomieu, E. Gillot, M. Safey El Din : “Computing points in connected components defined by a real inequation: algorithms, complexity and implementations, Part I”, (2026)