The following pages link to (Q4733937):
Displaying 12 items.
- Integer complexity: representing numbers of bounded defect (Q338388) (← links)
- Star reduction among minimal length addition chains (Q644852) (← links)
- Addition chains -- an erratic sequence (Q1313870) (← links)
- Internal structure of addition chains: well-ordering (Q1704595) (← links)
- On Bellman's and Knuth's problems and their generalizations (Q1791767) (← links)
- Addition chains, vector chains, and efficient computation (Q2214049) (← links)
- Integer complexity: the integer defect (Q2319502) (← links)
- On a generalization of addition chains: addition-multiplication chains (Q2467743) (← links)
- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION (Q5151088) (← links)
- EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS (Q5220293) (← links)
- Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems (Q5264769) (← links)
- Integer complexity: algorithms and computational results (Q5384256) (← links)
