The polytope-collision problem
The Orbit Problem consists of determining, given a matrix $A\in\mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of Kannan and Lipton in the 1980s. Subsequently, Kannan and Lip...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Leibniz International Proceedings in Informatics
2017
|