A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets

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]

@article{DinS17,
  title = {A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets},
  author = {Mohab Safey El Din and Éric Schost},
  year = {2017},
  doi = {10.1145/2996450},
  url = {http://doi.acm.org/10.1145/2996450},
  researchr = {https://researchr.org/publication/DinS17},
  cites = {0},
  citedby = {0},
  journal = {Journal of the ACM},
  volume = {63},
  number = {6},
}