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
scientific article; zbMATH DE number 6466124
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
