scientific article; zbMATH DE number 7204476

DOI10.4230/LIPICS.ICALP.2017.24zbMATH Open1441.68083arXiv1611.01344MaRDI QIDQ5111354FDOQ5111354

Authors: Shaull Almagor, Joël Ouaknine, James Worrell 

Publication date: 27 May 2020

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

Title of this publication is not available (Why is that?)

Recommendations

• The polyhedron-hitting problem
• The polyhedral Tammes problem
• Collision of convex objects
• scientific article; zbMATH DE number 1303549
• Collision problem for rigid bodies
• The polyhedral projection problem
• scientific article; zbMATH DE number 4202048
• A collision probability problem

zbMATH Keywords

orbit problemalgebraic algorithmslinear dynamical systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic dynamics (37B10) Decidability of theories and sets of sentences (03B25) Number-theoretic algorithms; complexity (11Y16)

Cited In (11)

• Polynomial-time algorithm for the orbit problem
• Algebraic model checking for discrete linear dynamical systems
• The polyhedral Tammes problem
• Title not available (Why is that?)
• On the complexity of the orbit problem
• The orbit problem in higher dimensions
• The polyhedron-hitting problem
• First-order orbit queries
• Title not available (Why is that?)
• On the polytope escape problem for continuous linear dynamical systems
• What's decidable about discrete linear dynamical systems?

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111354)