A probabilistic algorithm using polynomial approximation and computer algebra returns rational points whose epsilon-balls contain and separate all local minimizers of a noisy Morse function on the unit cube.
Heintz, Definability and fast quantifier elimination in algebraically closed fields , Theoret- ical Computer Science, 24 (1983), pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Probabilistic algorithm for computing all local minimizers of Morse functions on a compact domain
A probabilistic algorithm using polynomial approximation and computer algebra returns rational points whose epsilon-balls contain and separate all local minimizers of a noisy Morse function on the unit cube.