We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 5efe8bf commit f76ae9cCopy full SHA for f76ae9c
src/addition-chain-pow.jl
@@ -8,7 +8,7 @@
8
#
9
# To compute x^q in a minimal number of multiplications
10
# for 1 ≤ q ≤ 255, you compute x^r * x^s for
11
-# r = power_tree[i] and s = i-q, recursively
+# r = power_tree[q] and s = q-r, recursively
12
# (memoizing each power computation), and we implicitly
13
# define power_tree[0] = 0.
14
const power_tree = [
0 commit comments