A six-state minimal time solution to the firing squad synchronization problem
Theoretical Computer Science
An overview of the firing squad synchronization problem
Proceedings on LITP spring school on Theoretical Computer Science on Automata networks
Small sets supporting fary embeddings of planar graphs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The synchronization of nonuniform networks of finite automata
Information and Computation
Seven-state solutions to the Firing Squad Synchronization Problem
Theoretical Computer Science
Faster computation on directed networks of automata
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Computing with snakes in directed networks of automata
Journal of Algorithms
On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
Theoretical Computer Science
The wake up and report problem is time-equivalent to the firing squad synchronization problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computation: finite and infinite machines
Computation: finite and infinite machines
Sequential Machines: Selected Papers
Sequential Machines: Selected Papers
The synchronization of nonuniform networks of finite automata
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On the complexity of the “most general” firing squad synchronization problem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We show that if a minimal-time solution to a fundamental distributed computation primitive, synchronizing a network path of finite-state processors, exists on the three-dimensional, undirected grid, then we can conclude the purely complexity-theoretic result P=NP. Every previous result on network synchronization for various network topologies either demonstrates the existence of fast synchronization solutions or proves that a synchronization solution cannot exist at all To date, it is unknown whether there is a network topology for which there exists a synchronization solution but for which no minimal-time synchronization solution exists Under the assumption that P ≠ NP, this paper solves this longstanding open problem in the affirmative.