Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Mohab Safey El Din, Éric Schost. A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets. Journal of the ACM, 63(6), 2017. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity resultsRémi Prébet, Mohab Safey El Din, Éric Schost. JSC, 120:102234, 2024. [doi]
The following publications are possibly variants of this publication: