Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools (Q2059909)
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: Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools |
scientific article; zbMATH DE number 7444834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools |
scientific article; zbMATH DE number 7444834 |
Statements
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools (English)
0 references
14 December 2021
0 references
analysis of algorithms
0 references
double-base number system
0 references
asymptotic analysis
0 references
0.7377026081085205
0 references
0.7337396144866943
0 references
0.7167820334434509
0 references
0.7144137024879456
0 references
0.7011759877204895
0 references
