scientific article; zbMATH DE number 6862142

DOI10.4230/LIPIcs.STACS.2017.50zbMath1402.91089arXiv1609.07048MaRDI QIDQ4636651

Stéphane Le Roux, Arno Pauly, Jean-François Raskin

Publication date: 19 April 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

determinacycoNP-completeundecidablecontrol in \(\mathbb{R}^d\)polytopic/arbitrary

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving topology, set theory, or logic (91A44) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Unnamed Item ⋮ On decidability and complexity of low-dimensional robot games

This page was built for publication: