... 该算法的基本操作是乘法操作。时间复杂度为 O(n3) 1.3.4算法的存储空间(Memory Space for Algorithms) 算法的空间复杂度S(n) = O(g(n)) ...
基于1个网页-相关网页
同时我们也会讨论其它重要资源的测度，比如算法的空间复杂度。
We will also discuss the other important resource measure , namely the space required by an algorithm.
在实际应用中，动态规划算法的空间复杂度是限制问题规模的瓶颈。
In practical application, the spacial complexity of algorithm is the bottleneck of problem's scale.
论文提出的一种基于比特翻转和减小搜索空间的算法，在不增加系统复杂度的情况下，可以比较明显地提高捕获速度。
In this paper, a new strategy based on search space reduction and bit reversal algorithm is proposed, which could magnificently improve the speed of acquisition without additional complexity.
应用推荐