A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\) (Q2041690)
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: A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\) |
scientific article; zbMATH DE number 7374552
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\) |
scientific article; zbMATH DE number 7374552 |
Statements
A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\) (English)
0 references
23 July 2021
0 references
cellular automaton
0 references
firing squad synchronization problem
0 references
FSSP
0 references
smallest FSSP protocol
0 references
state lower bound
0 references
full versus partial solution
0 references
0.83809245
0 references
0.80139333
0 references
0.79700696
0 references
0.7934541
0 references
0.79188263
0 references
0.79058224
0 references
