The Polyhedron-Hitting Problem

DOI10.1137/1.9781611973730.64zbMath1372.68260arXiv1407.1889OpenAlexW2953344520MaRDI QIDQ5362998

Ventsislav Chonev, Joël Ouaknine, James Worrell

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.1889

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) (n)-dimensional polytopes (52B11) Decidability (number-theoretic aspects) (11U05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Number-theoretic algorithms; complexity (11Y16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

What's decidable about discrete linear dynamical systems? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ First-order orbit queries ⋮ Complexity of Restricted Variants of Skolem and Related Problems ⋮ O-Minimal Invariants for Discrete-Time Dynamical Systems ⋮ Algebraic model checking for discrete linear dynamical systems

This page was built for publication: The Polyhedron-Hitting Problem