A combinatorial characterization of the distributed 1-solvable tasks (Q3485850)
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 combinatorial characterization of the distributed 1-solvable tasks |
scientific article; zbMATH DE number 4157854
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial characterization of the distributed 1-solvable tasks |
scientific article; zbMATH DE number 4157854 |
Statements
A combinatorial characterization of the distributed 1-solvable tasks (English)
0 references
1990
0 references
distributed agreement
0 references
faulty processor
0 references
protocol
0 references
lower bounds
0 references
0.9071152
0 references
0.8712759
0 references
0.8682536
0 references
0.86023223
0 references
0.85745335
0 references
0.8549934
0 references
0 references
