• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Continuous-time orbit problems are decidable in polynomial-time.

Taolue ChenNengkun YuTingting 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