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
Language | Label | Description | Also known as |
---|---|---|---|
English | The bit complexity of the predecessor problem |
scientific article |
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