On the complexity of the orbit problem

On the complexity of the orbit problem

Show other versions (1)

We consider higher-dimensional versions of Kannan and Lipton’s Orbit Problem—determining whether a target vector space V may be reached from a starting point x under repeated applications of a linear transformation A. Answering two questions posed by Kannan and Lipton in the 1980s, we show that when...

Fuld beskrivelse

Bibliografiske detaljer
Main Authors:	Chonev, V, Ouaknine, J, Worrell, J
Format:	Journal article
Udgivet:	Association for Computing Machinery 2016

Lignende værker

On the complexity of the orbit problem
af: Chonev, V, et al.
Udgivet: (2016)

The orbit problem in higher dimensions
af: Chonev, V, et al.
Udgivet: (2013)

On the skolem problem for continuous linear dynamical systems
af: Chonev, V, et al.
Udgivet: (2016)

On the Skolem Problem for continuous linear dynamical systems
af: Ouaknine, J, et al.
Udgivet: (2016)

The Semialgebraic Orbit Problem
af: Almagor, S, et al.
Udgivet: (2019)

On recurrent reachability for continuous linear dynamical systems
af: Ouaknine, J, et al.
Udgivet: (2016)

On recurrent reachability for continuous linear dynamical systems
af: Chonev, V, et al.
Udgivet: (2016)

First-order orbit queries
af: Almagor, S, et al.
Udgivet: (2020)

Semialgebraic invariant synthesis for the Kannan-Lipton Orbit Problem
af: Fijalkow, N, et al.
Udgivet: (2017)

Semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
af: Fijalkow, N, et al.
Udgivet: (2017)

Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
af: Fijalkow, N, et al.
Udgivet: (2019)

On the Complexity of the Equivalence Problem for Probabilistic Automata
af: Kiefer, S, et al.
Udgivet: (2012)

The Orbit Problem for parametric linear dynamical systems
af: Baier, C, et al.
Udgivet: (2021)

Decision Problems for Linear Recurrence Sequences.
af: Ouaknine, J, et al.
Udgivet: (2012)

The polytope-collision problem
af: Almagor, S, et al.
Udgivet: (2017)

ON THE DECIDABILITY AND COMPLEXITY OF METRIC TEMPORAL LOGIC OVER FINITE WORDS
af: Ouaknine, J, et al.
Udgivet: (2007)

On the complexity of the Escape Problem for linear dynamical systems over compact semialgebraic sets
af: D'Costa, J, et al.
Udgivet: (2021)

Reachability problems for linear dynamical systems
af: Chonev, V
Udgivet: (2015)

Decision problems for second-order holonomic sequences
af: Neumann, E, et al.
Udgivet: (2021)

Nonnegativity problems for matrix semigroups
af: D'Costa, J, et al.
Udgivet: (2024)

On the Relationship between Reachability Problems in Timed and Counter Automata
af: Haase, C, et al.
Udgivet: (2012)

On the relationship between reachability problems in timed and counter automata
af: Haase, C, et al.
Udgivet: (2012)

On the decidability and complexity of Metric Temporal Logic over finite words
af: Joel Ouaknine, et al.
Udgivet: (2007-02-01)

On reachability problems for low-dimensional matrix semigroups
af: Colcombet, T, et al.
Udgivet: (2019)

On the polytope escape problem for continuous linear dynamical systems
af: Ouaknine, J, et al.
Udgivet: (2017)

The Church Synthesis Problem with Metric
af: Jenkins, M, et al.
Udgivet: (2011)

On the Skolem problem and prime powers
af: Ouaknine, J, et al.
Udgivet: (2020)

On expressiveness and complexity in real-time model checking
af: Bouyer, P, et al.
Udgivet: (2008)

The 2-dimensional constraint loop problem is decidable
af: Guilmant, Q, et al.
Udgivet: (2024)

Decidability and complexity results for timed automata via channel machines
af: Abdulla, P, et al.
Udgivet: (2005)

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA
af: Kiefer, S, et al.
Udgivet: (2013)

On metric temporal logic and faulty turing machines
af: Ouaknine, J, et al.
Udgivet: (2006)

Some Recent Results in Metric Temporal Logic
af: Ouaknine, J, et al.
Udgivet: (2008)

Towards a Theory of Time-Bounded Verification.
af: Ouaknine, J, et al.
Udgivet: (2010)

Safety metric temporal logic is fully decidable
af: Ouaknine, J, et al.
Udgivet: (2006)

On the Skolem problem and the Skolem conjecture
af: Lipton, RJ, et al.
Udgivet: (2022)

On the Monniaux Problem in abstract interpretation
af: Fijalkow, N, et al.
Udgivet: (2019)

The pseudo-Skolem Problem is decidable
af: D'Costa, J, et al.
Udgivet: (2021)

The pseudo-reachability problem for diagonalisable linear dynamical systems
af: D'Costa, J, et al.
Udgivet: (2022)

Undecidability of Universality for Timed Automata with Minimal Resources
af: Adams, S, et al.
Udgivet: (2007)