2014/07/07 · Abstract:We consider polyhedral versions of Kannan and Lipton's Orbit Problem (STOC '80 and JACM '86)---determining whether a target ...

Solving this problem is instrumental in our decision procedures for both the Extended Orbit. Problem and the Polyhedron-Hitting Problem. The asymptotic ...

Solving this problem is instrumental in our decision procedures for both the Extended Orbit. Problem and the Polyhedron-Hitting Problem. The asymptotic ...

We present what amounts to a complete characterisation of the decidability landscape for this problem, expressed as a function of the dimension m of the ambient ...

This work presents what amounts to a complete characterisation of the decidability landscape for the Polyhedron-Hitting Problem, expressed as a function of ...

We consider polyhedral versions of Kannan and Lipton's Orbit Problem [14, 13]---determining whether a target polyhedron V may be reached from a starting ...

In Tarasov and Vyalyi [2011], the Polyhedron Hitting Problem is related to decision problems in formal language theory. Some partial decidability results ...

2014/12/22 · The papers in this volume were presented at the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, held January 4–6, ...

2021/02/02 · Bibliographic details on The Polyhedron-Hitting Problem.

In this paper, we study a natural generalisation of the Orbit Problem, which we call the Polyhedron-Hitting Problem, in which the target V V V is allowed to be ...