英 [ˌekspəˌnenʃɪˈeɪʃən] 美 [ˌekspoʊˌnenʃɪˈeɪʃn]
n. [数] 取幂，求幂；乘方
the process of raising a quantity to some assigned power
同义词： involution
模幂-引用次数：18
Of course,to keep balance between speed and hardware resource, we also provide methods to realize modular multiplication and exponentiation with n/2+1 PEs,for which we have also provided comprehensive analysis.
当然,考虑到对速度和硬件资源的不同需求,我们也给出了使用n/2+1个 PE 来计算模乘、模幂的实现算法,并做出了相应的数据分析。
求幂
取幂
取幂
乘方
... 指数 Exponent Characters 指数型平滑 Exponentiation 取幕 exponention notation ...
[数]取幂，求幂；乘方
We need to know how hard it is to reverse the exponentiation.
我们需要知道求幂运算的逆运算的难度。
See Integer Exponentiation. Hint: choose either of the bottom two functions.
看到整数求幂运算。提示：下面两个函数的选择。
Finally, the operator ** performs exponentiation; that is, it raises a number to a power.
最后，再说个运算符**，它表示乘方，就是前一个数为底数，后一个数为指数的次幂运算。
So I'm going to build something that's going to do iterative exponentiation.
首先我会写一个,迭代乘法的过程。
计算机科学及编程导论课程节选 : 麻省理工公开课
This is another way of doing exponentiation, but this one's a recursive function. All right?
但这是一种递归的方法对不对？,好，让我们看看这种方法？
计算机科学及编程导论课程节选 : 麻省理工公开课
So let me show you another way I could do exponentiation. Taking an advantage of a trick.
看我怎么用这个小技巧,来求a的b次方的。
计算机科学及编程导论课程节选 : 麻省理工公开课