论文部分内容阅读
讨论了n位二进制整数乘法下界面－时平方复杂性问题，给出了一种树型布局的乘法器网络模型，并分析了它的AT~2复杂性
This paper discusses the problem of squared complexarity under n-bit binary integer multiplication, and presents a tree model of multiplier network with its AT ~ 2 complexity