A general Sequential Time-Space Tradeoff for Finding Unique Elements (Q3210181)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4191123
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A general Sequential Time-Space Tradeoff for Finding Unique Elements |
scientific article; zbMATH DE number 4191123 |
Statements
A general Sequential Time-Space Tradeoff for Finding Unique Elements (English)
0 references
1991
0 references
time-space tradeoff
0 references
computational complexity
0 references
lower bound
0 references
sorting
0 references
branching program
0 references
0.91690844
0 references
0.9111918
0 references
0.9014047
0 references
0.87517905
0 references
0.87340087
0 references
0.84887457
0 references
0.84377706
0 references
