Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman's and Knuth's problems (Q5264769)
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 6466124
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman's and Knuth's problems |
scientific article; zbMATH DE number 6466124 |
Statements
Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems (English)
0 references
27 July 2015
0 references
addition chain
0 references
evaluation of powers
0 references
evaluation of monomials
0 references
Bellman's problem
0 references
Knuth's problem
0 references
0.9126127362251282
0 references
0.8848490118980408
0 references
0.8386106491088867
0 references
0.7859134674072266
0 references
