Talk:Addition-chain exponentiation: Difference between revisions

Quoting [http://strangelyconsistent.org/blog/t3-addition-chains this]: '''" A Brauer-based algorithm will fail the first time at N = 12509]."''' (if this site is not enough for you, I'll try to give you the reference in Knuth's TAOCP then, as I'm sure to have read this in one of the volumes). It's far below the values of the task, which is a big problem for me. And the article linked in the Go program does not claim to give optimal solution, on the contrary: '''"Even though minimal-length cf-chains are not optimal, they have the nice property of being easy to compute [...]"'''.