Login / Signup
Continuous-time orbit problems are decidable in polynomial-time.
Taolue Chen
Nengkun Yu
Tingting Han
Published in:
Inf. Process. Lett. (2015)
Keyphrases
</>
optimization problems
neural network
computational complexity
special case
problems involving
polynomial hierarchy
data sets
first order logic
dynamical systems