A single, simple search algorithm decides the escape problem for all robust instances, and is provably complete for the weakest representation of continuous functions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
A single, simple search algorithm decides the escape problem for all robust instances, and is provably complete for the weakest representation of continuous functions.