Computing Sequences with Addition Chains-Reference-Cited by-同舟云学术

Computing Sequences with Addition Chains

Published:1981-08 Issue:3 Volume:10 Page:638-646
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Downey Peter,Leong Benton,Sethi Ravi

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Link

http://epubs.siam.org/doi/pdf/10.1137/0210047

Reference8 articles.

1. On addition chains

2. Addition Chain Methods for the Evaluation of Specific Polynomials

3. Remarks on number theory III. On addition chains

4. Reducibility among Combinatorial Problems

5. Donald E. Knuth, The art of computer programming. Vol. 2: Seminumerical algorithms, Addison-Wesley Publishing Co., Reading, Mass.London-Don Mills, Ont, 1969, 398–42244:35310191.18001

Cited by 80 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Construction of Short Addition-Subtraction Chains and their Applications;Tatra Mountains Mathematical Publications;2023-02-01

2. Ladderpath Approach: How Tinkering and Reuse Increase Complexity and Information;Entropy;2022-08-05

3. Comparing the Computational Complexity of Monomials and Elements of Finite Abelian Groups;Moscow University Mathematics Bulletin;2022-06

4. Comparison of complexity bounds for Bellman and Lupanov problems;Proceedings of Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications";2022

5. Bellman's, Knut's, Lupanov's, Pippenger's problems and their variations as generalizations of the addition chain problem;Mathematical Problems of Cybernetics;2022