搜索资源列表
-
0下载:
素数测试问题,
如果把乘、除法(包括取模)看成常数时间,
则算法的时间复杂度为 (k)= (log m)=O(log n)。
而当n极大时,与n在同一数量级的两个数相乘除,
不超过O(log2n)次二进制位操作。
∴算法的时间复杂性为O(log3n)二进制位操作
-Prime test,
If the multiplication, division ( including the modulus as a constant
-
-
0下载:
零/恒模信号的盲源分离算法 matlab实现-Zero/constant modulus signal blind source separation algorithm is proposed
-
-
0下载:
常数模与判决引导联合算法,程序经测试是有效的-Constant modulus and decision directed algorithm, the program has been tested and is effective.
-
-
3下载:
归一化恒模盲均衡算法的matlab仿真,并附有说明-Normalized constant modulus blind equalization algorithm matlab simulation, along with instructions
-
-
0下载:
单向拉伸的umat子程序,应力更新为常刚度算法-UMAT SUBROUTINE,Using constant modulus stress updating algorithm.von mises criteria
-