On the time complexity of minimum and maximum global snapshot problems (Q293343)
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: On the time complexity of minimum and maximum global snapshot problems |
scientific article; zbMATH DE number 6590742
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the time complexity of minimum and maximum global snapshot problems |
scientific article; zbMATH DE number 6590742 |
Statements
On the time complexity of minimum and maximum global snapshot problems (English)
0 references
9 June 2016
0 references
distributed systems
0 references
computational complexity
0 references
error detection
0 references
global snapshot
0 references
0.7336089611053467
0 references
0.7241382002830505
0 references
0.7176042199134827
0 references
0.716939389705658
0 references
0.7097402215003967
0 references
