Using genetic algorithms to solve NP-complete problems
Proceedings of the third international conference on Genetic algorithms
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Practical genetic algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
An analysis of exponentiation based on formal languages
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
Addition and addition-subtraction chains consist of a sequence of integers that allow one to efficiently compute power TE, where T varies but E is constant. The shorter the addition (addition-subtraction) chain is, the more efficient the computation. Solving the optimisation problem that yields the shortest addition (addition-subtraction) is NP-hard. There exists some heuristics that attempt to obtain reduced addition (addition-subtraction) chain. We obtain better addition (addition-subtraction) chains than those yield by so far known heuristics using genetic algorithms. The addition (addition-subtraction) chains are nearly minimal.