On the Complexity of the “Most General” Undirected Firing Squad Synchronization Problem
DOI10.1007/978-3-540-77120-3_23zbMath1193.68131OpenAlexW1574468468MaRDI QIDQ5387761
Kojiro Kobayashi, Darin Goldstein
Publication date: 27 May 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_23
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)
This page was built for publication: On the Complexity of the “Most General” Undirected Firing Squad Synchronization Problem
