Presents a probabilistic critical-point algorithm that samples points in connected components of semi-algebraic sets defined by a single polynomial, achieving bit complexity cubic or quartic in the Bézout bound under a smoothness assumption.
msolve: A Library for Solving Polynomial Systems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computing points in connected components defined by a real inequation: algorithms, complexity and implementations, Part I
Presents a probabilistic critical-point algorithm that samples points in connected components of semi-algebraic sets defined by a single polynomial, achieving bit complexity cubic or quartic in the Bézout bound under a smoothness assumption.