On the complexity of the orbit problem

On the complexity of the orbit problem

Показать другие версии (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...

Полное описание

Библиографические подробности
Главные авторы:	Chonev, V, Ouaknine, J, Worrell, J
Формат:	Journal article
Опубликовано:	Association for Computing Machinery 2016

Схожие документы

On the complexity of the orbit problem
по: Chonev, V, и др.
Опубликовано: (2016)

The orbit problem in higher dimensions
по: Chonev, V, и др.
Опубликовано: (2013)

On the skolem problem for continuous linear dynamical systems
по: Chonev, V, и др.
Опубликовано: (2016)

On the Skolem Problem for continuous linear dynamical systems
по: Ouaknine, J, и др.
Опубликовано: (2016)

The Semialgebraic Orbit Problem
по: Almagor, S, и др.
Опубликовано: (2019)

On recurrent reachability for continuous linear dynamical systems
по: Ouaknine, J, и др.
Опубликовано: (2016)

On recurrent reachability for continuous linear dynamical systems
по: Chonev, V, и др.
Опубликовано: (2016)

First-order orbit queries
по: Almagor, S, и др.
Опубликовано: (2020)

Semialgebraic invariant synthesis for the Kannan-Lipton Orbit Problem
по: Fijalkow, N, и др.
Опубликовано: (2017)

Semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
по: Fijalkow, N, и др.
Опубликовано: (2017)

Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
по: Fijalkow, N, и др.
Опубликовано: (2019)

On the Complexity of the Equivalence Problem for Probabilistic Automata
по: Kiefer, S, и др.
Опубликовано: (2012)

The Orbit Problem for parametric linear dynamical systems
по: Baier, C, и др.
Опубликовано: (2021)

Decision Problems for Linear Recurrence Sequences.
по: Ouaknine, J, и др.
Опубликовано: (2012)

The polytope-collision problem
по: Almagor, S, и др.
Опубликовано: (2017)

ON THE DECIDABILITY AND COMPLEXITY OF METRIC TEMPORAL LOGIC OVER FINITE WORDS
по: Ouaknine, J, и др.
Опубликовано: (2007)

On the complexity of the Escape Problem for linear dynamical systems over compact semialgebraic sets
по: D'Costa, J, и др.
Опубликовано: (2021)

Reachability problems for linear dynamical systems
по: Chonev, V
Опубликовано: (2015)

Decision problems for second-order holonomic sequences
по: Neumann, E, и др.
Опубликовано: (2021)

Nonnegativity problems for matrix semigroups
по: D'Costa, J, и др.
Опубликовано: (2024)

On the Relationship between Reachability Problems in Timed and Counter Automata
по: Haase, C, и др.
Опубликовано: (2012)

On the relationship between reachability problems in timed and counter automata
по: Haase, C, и др.
Опубликовано: (2012)

On the decidability and complexity of Metric Temporal Logic over finite words
по: Joel Ouaknine, и др.
Опубликовано: (2007-02-01)

On reachability problems for low-dimensional matrix semigroups
по: Colcombet, T, и др.
Опубликовано: (2019)

On the polytope escape problem for continuous linear dynamical systems
по: Ouaknine, J, и др.
Опубликовано: (2017)

The Church Synthesis Problem with Metric
по: Jenkins, M, и др.
Опубликовано: (2011)

On the Skolem problem and prime powers
по: Ouaknine, J, и др.
Опубликовано: (2020)

On expressiveness and complexity in real-time model checking
по: Bouyer, P, и др.
Опубликовано: (2008)

The 2-dimensional constraint loop problem is decidable
по: Guilmant, Q, и др.
Опубликовано: (2024)

Decidability and complexity results for timed automata via channel machines
по: Abdulla, P, и др.
Опубликовано: (2005)

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA
по: Kiefer, S, и др.
Опубликовано: (2013)

On metric temporal logic and faulty turing machines
по: Ouaknine, J, и др.
Опубликовано: (2006)

Some Recent Results in Metric Temporal Logic
по: Ouaknine, J, и др.
Опубликовано: (2008)

Towards a Theory of Time-Bounded Verification.
по: Ouaknine, J, и др.
Опубликовано: (2010)

Safety metric temporal logic is fully decidable
по: Ouaknine, J, и др.
Опубликовано: (2006)

On the Skolem problem and the Skolem conjecture
по: Lipton, RJ, и др.
Опубликовано: (2022)

On the Monniaux Problem in abstract interpretation
по: Fijalkow, N, и др.
Опубликовано: (2019)

The pseudo-Skolem Problem is decidable
по: D'Costa, J, и др.
Опубликовано: (2021)

The pseudo-reachability problem for diagonalisable linear dynamical systems
по: D'Costa, J, и др.
Опубликовано: (2022)

Undecidability of Universality for Timed Automata with Minimal Resources
по: Adams, S, и др.
Опубликовано: (2007)