加法鏈上的Scholz-Brauer猜測之研究
給定一個自然數n,如何最有效率的計算Xn?此處Xn表X自乘n次,X可以是任一具有乘法的代數體系中元素;所謂最有效率是指使用最少次的乘法。由此引發了“加法鏈”的概念及許多有趣的數學問題。Knuth[1]的話恰說明了本研究的動機:\r Not only because it is interesing in its own right, but because it is an excellent example of the theoretical questions that arise in the study of "optimum methods of computation."