Minimum and non-minimum time solutions to the firing squad synchronization problem (Q2944883)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum and non-minimum time solutions to the firing squad synchronization problem |
scientific article; zbMATH DE number 6479414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum and non-minimum time solutions to the firing squad synchronization problem |
scientific article; zbMATH DE number 6479414 |
Statements
Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem (English)
0 references
8 September 2015
0 references
FSSP
0 references
cellular automata
0 references
synchronous computations
0 references
channel capacity
0 references
0 references
0 references
0.8645443916320801
0 references
0.8638588786125183
0 references
0.84540855884552
0 references
