Minimum firing times of firing squad synchronization problems for paths in grid spaces

arXiv1909.05406MaRDI QIDQ6325130FDOQ6325130

Authors: Kojiro Kobayashi 

Publication date: 5 September 2019

Abstract: We consider the firing squad synchronization problems for paths in the two and the three-dimensional grid spaces. Minimal-time solutions of these problems are not known and are unlikely to exist. However, at present we have no proofs of their nonexistence. In this paper we show one result that suggests what type of study is necessary in order to prove their nonexistence.

This page was built for publication: Minimum firing times of firing squad synchronization problems for paths in grid spaces

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