The bit complexity of the predecessor problem (Q287147)
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: The bit complexity of the predecessor problem |
scientific article; zbMATH DE number 6585451
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The bit complexity of the predecessor problem |
scientific article; zbMATH DE number 6585451 |
Statements
The bit complexity of the predecessor problem (English)
0 references
26 May 2016
0 references
distributed computing
0 references
unidirectional
0 references
anonymous ring
0 references
0.7888272404670715
0 references
0.7823248505592346
0 references
0.7522632479667664
0 references
0.7454935908317566
0 references
0.7454935908317566
0 references
