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...

書目詳細資料
Main Authors:	Chonev, V, Ouaknine, J, Worrell, J
格式:	Journal article
出版:	Association for Computing Machinery 2016

相似書籍

On the complexity of the orbit problem
由: Chonev, V, et al.
出版: (2016)

The orbit problem in higher dimensions
由: Chonev, V, et al.
出版: (2013)

On the skolem problem for continuous linear dynamical systems
由: Chonev, V, et al.
出版: (2016)

On the Skolem Problem for continuous linear dynamical systems
由: Ouaknine, J, et al.
出版: (2016)

The Semialgebraic Orbit Problem
由: Almagor, S, et al.
出版: (2019)

On recurrent reachability for continuous linear dynamical systems
由: Ouaknine, J, et al.
出版: (2016)

On recurrent reachability for continuous linear dynamical systems
由: Chonev, V, et al.
出版: (2016)

First-order orbit queries
由: Almagor, S, et al.
出版: (2020)

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

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

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

On the Complexity of the Equivalence Problem for Probabilistic Automata
由: Kiefer, S, et al.
出版: (2012)

The Orbit Problem for parametric linear dynamical systems
由: Baier, C, et al.
出版: (2021)

Decision Problems for Linear Recurrence Sequences.
由: Ouaknine, J, et al.
出版: (2012)

The polytope-collision problem
由: Almagor, S, et al.
出版: (2017)

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

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

Reachability problems for linear dynamical systems
由: Chonev, V
出版: (2015)

Decision problems for second-order holonomic sequences
由: Neumann, E, et al.
出版: (2021)

Nonnegativity problems for matrix semigroups
由: D'Costa, J, et al.
出版: (2024)

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

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

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

On reachability problems for low-dimensional matrix semigroups
由: Colcombet, T, et al.
出版: (2019)

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

The Church Synthesis Problem with Metric
由: Jenkins, M, et al.
出版: (2011)

On the Skolem problem and prime powers
由: Ouaknine, J, et al.
出版: (2020)

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

The 2-dimensional constraint loop problem is decidable
由: Guilmant, Q, et al.
出版: (2024)

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

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

On metric temporal logic and faulty turing machines
由: Ouaknine, J, et al.
出版: (2006)

Some Recent Results in Metric Temporal Logic
由: Ouaknine, J, et al.
出版: (2008)

Towards a Theory of Time-Bounded Verification.
由: Ouaknine, J, et al.
出版: (2010)

Safety metric temporal logic is fully decidable
由: Ouaknine, J, et al.
出版: (2006)

On the Skolem problem and the Skolem conjecture
由: Lipton, RJ, et al.
出版: (2022)

On the Monniaux Problem in abstract interpretation
由: Fijalkow, N, et al.
出版: (2019)

The pseudo-Skolem Problem is decidable
由: D'Costa, J, et al.
出版: (2021)

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

Undecidability of Universality for Timed Automata with Minimal Resources
由: Adams, S, et al.
出版: (2007)