Efficient Generation of Minimal Length Addition Chains
暂无分享,去创建一个
[1] P. Erdös. Remarks on number theory III. On addition chains , 1960 .
[2] Matthijs J. Coster,et al. Addition Chain Heuristics , 1989, CRYPTO.
[3] Neil J. A. Sloane,et al. The encyclopedia of integer sequences , 1995 .
[4] Edward G. Thurber. Addition chains and solutions of l(2n) = l(n) and l(2n - 1) = n + l(n) - 1 , 1976, Discret. Math..
[5] Edward G. Thurber. Addition chains - an erratic sequence , 1993, Discret. Math..
[6] Y. Tsai,et al. On addition chains , 1992 .
[7] Peter J. Downey,et al. Computing Sequences with Addition Chains , 1981, SIAM J. Comput..
[8] David Thomas,et al. The Art in Computer Programming , 2001 .
[9] J. Berstel,et al. Efficient computation of addition chains , 1994 .
[10] Arnold Schönhage. A Lower Bound for the Length of Addition Chains , 1975, Theor. Comput. Sci..
[11] Richard J. Lipton,et al. Addition Chain Methods for the Evaluation of Specific Polynomials , 1980, SIAM J. Comput..
[12] Srecko Brlek,et al. Addition Chains Using Continued Fractions , 1989, J. Algorithms.
[13] Edward G. Thurber. The Scholz-Brauer problem on addition chains. , 1973 .
[14] W. Utz. A note on the Scholz-Brauer problem in addition chains , 1953 .