比特串 meaning in English
bslbf bit string left bit first
Examples
- Simple biological aging model based on bit - string with intelligence
基于智能因素的比特串生态演化模型 - If the run begins with a 1 , we start the list with the number 0 , meaning the 1s start the bit string
如果开始出现的是1 ，我们以数字0来开始这个序列，表示这个比特串以1开始。 - Suppose you want to encode the bit string " 1110011 . " an inversion list would store a list of three numbers : 0 , 3 , 5
假设您要对一个比特串“ 1110011 ”进行编码。倒排表将存储一个由三个数字构成的序列： 0 ， 3 ， 5 。 - All we store is the start position of the 1s , then the start position of the 0s , then the position of 1s again , and so on until the bit string is over
我们存储的是，开始出现1的位置，开始出现0的位置，然后再是出现1的位置，如此重复直到比特串结束。 - So , we put forward an optimized exponential algorithm in which the multiplication with itself was substituted mostly by square . through expanding of composition fields , the time consuming of optimal algorithm is , where n is the number of bits of exponential
通过对算法的分析我们可以得出结论，随着复合域的不断增大，域上指数运算所需的时间可近似表示为，式中n为指数以二进制表示时的比特串长度，为域元素进行多项式相乘所需的时间。