Downey, Peter; Leong, Benton; Sethi, Ravi (1981), "Computing sequences with addition chains", SIAM Journal on Computing, 10 (3): 638–646, doi:10.1137/0210047. A number of other papers state that finding a shortest addition chain for a single number is NP-complete, citing this paper, but it does not claim or prove such a result.