Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 5 Sep 2019 in cs.FL and math.CO | (1909.05406v1)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Kojiro Kobayashi 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up