@article{ROUILLIER2000716,
    Abstract = {Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm for this test. We find, when the algebraic set is non empty, at least one point on each semi-algebraically connected component. The problem is reduced to deciding the existence of real critical points of the distance function and computing them.},
    Author = {Rouillier, F. and Roy, M.-F. and {Safey El Din}, M.},
    File = {Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation - 1-s2.0-S0885064X00905636-main - a.pdf},
    ISSN = {0885-064X},
    Journal = {Journal of Complexity},
    Number = {4},
    Pages = {716-750},
    Title = {Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation},
    URL = {https://www.sciencedirect.com/science/article/pii/S0885064X00905636},
    Volume = {16},
    Year = {2000},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0885064X00905636},
    bdsk-url-2 = {https://doi.org/10.1006/jcom.2000.0563},
    date-added = {2022-11-26 17:16:45 +0100},
    date-modified = {2022-11-26 17:16:45 +0100},
    doi = {10.1006/jcom.2000.0563}
}

@article{ROUILLIER2000716, Abstract = {Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm for this test. We find, when the algebraic set is non empty, at least one point on each semi-algebraically connected component. The problem is reduced to deciding the existence of real critical points of the distance function and computing them.}, Author = {Rouillier, F. and Roy, M.-F. and {Safey El Din}, M.}, File = {Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation - 1-s2.0-S0885064X00905636-main - a.pdf}, ISSN = {0885-064X}, Journal = {Journal of Complexity}, Number = {4}, Pages = {716-750}, Title = {Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation}, URL = {https://www.sciencedirect.com/science/article/pii/S0885064X00905636}, Volume = {16}, Year = {2000}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0885064X00905636}, bdsk-url-2 = {https://doi.org/10.1006/jcom.2000.0563}, date-added = {2022-11-26 17:16:45 +0100}, date-modified = {2022-11-26 17:16:45 +0100}, doi = {10.1006/jcom.2000.0563} }