On the algorithmic complexity of some numeration-related problems (Q5859586)
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 7334612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the algorithmic complexity of some numeration-related problems |
scientific article; zbMATH DE number 7334612 |
Statements
On the algorithmic complexity of some numeration-related problems (English)
0 references
16 April 2021
0 references
numeration system
0 references
generalized number system
0 references
expansive polynomials
0 references
algorithmic complexity
0 references
0.720425009727478
0 references
0.7194328308105469
0 references
0.7112095355987549
0 references
0.7055624127388
0 references
