scientific article; zbMATH DE number 4120283
From MaRDI portal
Publication:4733937
zbMath0684.10053MaRDI QIDQ4733937
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
Integer complexity: representing numbers of bounded defect ⋮ Internal structure of addition chains: well-ordering ⋮ Star reduction among minimal length addition chains ⋮ Addition chains, vector chains, and efficient computation ⋮ IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION ⋮ On a generalization of addition chains: addition-multiplication chains ⋮ On Bellman's and Knuth's problems and their generalizations ⋮ Integer complexity: algorithms and computational results ⋮ EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS ⋮ Integer complexity: the integer defect ⋮ Addition chains -- an erratic sequence ⋮ Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems
This page was built for publication:
