View Single Post
Old 2020-08-06, 18:59   #23
bsquared's Avatar
Feb 2007

2·412 Posts

Maybe also relevant to mention that the problem of finding the shortest addition chain for a given binary string is known to be NP-hard (section 14.102 in HOAC). But you'd only have to do it once for a fixed B1.

Last fiddled with by bsquared on 2020-08-06 at 19:00
bsquared is offline   Reply With Quote