scientific article; zbMATH DE number 7559115
From MaRDI portal
Publication:5090452
DOI10.4230/LIPIcs.STACS.2019.6MaRDI QIDQ5090452
Joël Ouaknine, Shaull Almagor, James Worrell
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1901.11023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
What's decidable about discrete linear dynamical systems? ⋮ The computability of LQR and LQG control ⋮ Unnamed Item ⋮ First-order orbit queries ⋮ Algebraic model checking for discrete linear dynamical systems
Cites Work
- Occurrence of zero in a linear recursive sequence
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Computing polynomial program invariants
- Logarithmic forms and group varieties.
- On the Complexity of the Orbit Problem
- Polynomial-time algorithm for the orbit problem
- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
- The Polyhedron-Hitting Problem
- Symbolic reachability computation for families of linear vector fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
