Talk:Addition-chain exponentiation: Difference between revisions
Content added Content deleted
(→wikipedia content: ref results for task) |
|||
| Line 69: | Line 69: | ||
: This appears to be a really hard problem. Most relevant page on the web so far: [[http://wwwhomes.uni-bielefeld.de/achim/addition_chain.html]], and in particular the paper [[http://wwwhomes.uni-bielefeld.de/achim/ac.ps.gz]]. I have doubts on the possibility of anyone implementing it on RC. --[[User:Ledrug|Ledrug]] 15:59, 27 August 2011 (UTC) |
: This appears to be a really hard problem. Most relevant page on the web so far: [[http://wwwhomes.uni-bielefeld.de/achim/addition_chain.html]], and in particular the paper [[http://wwwhomes.uni-bielefeld.de/achim/ac.ps.gz]]. I have doubts on the possibility of anyone implementing it on RC. --[[User:Ledrug|Ledrug]] 15:59, 27 August 2011 (UTC) |
||
: From the search tool on the page linked above:<lang>1 2 4 5 10 20 40 80 160 320 321 641 1282 1923 3846 7692 15384 15705 31410 31415 |
|||
1 2 3 5 10 20 23 43 53 106 212 424 848 1696 3392 6784 13568 13591 27182</lang> |
|||
::Computing optimal addition chains for a sequence of multiplications is harder than for a single multiplication. I believe I have an implementation for the simple case asked for here. --[[User:Rdm|Rdm]] 16:39, 27 August 2011 (UTC) |
::Computing optimal addition chains for a sequence of multiplications is harder than for a single multiplication. I believe I have an implementation for the simple case asked for here. --[[User:Rdm|Rdm]] 16:39, 27 August 2011 (UTC) |
||