complexity of things

complexity of things的基本解释

-

天高地厚

与complexity of things相关的网络例句 [注：此内容来源于网络，仅供参考]

To begin with, theory of FCSR and its sequence is summarized and investigated. Furthermore, emphasis is placed on the vaule of 2-adic complexity. A conclusion is drawn that the vaule lies in the relation between 2-adic complexity and lineai complexity of a same seqence. Fact that there exists sequence with high linear complexity but low 2-adic complexity is given and analyzed. The value of 2-adic complexity in cryptanalysis can be directly drawn from the very fact. A series of problems are opened based on the value and discussions are done in various depth. Some good results are obtained in these problems such as the 2-adic complexity distribution of periodic sequences and the stability of 2-adic complexity. The value of FCSR in stream cipher design is discussed at the same time.

首先对FCSR及其序列理论进行了系统的总结和研究，然后重点探讨了2-adic复杂度的流密码意义，通过论证表明，存在线性复杂度较大而2-adic复杂度较小的序列类，从而明确了2-adic复杂度的流密码分析意义，进而提出了一系列相关的研究问题并进行了不同深度的探讨，对其中周期序列的2-adic复杂度分布和2-adic复杂度的稳定性等问题得到了较好的结果；同时对FCSR的流密码设计意义进行了探讨，对其中的问题给出了一些思路或简单结论。

The characters of linear complexity profile of periodic sequences are investigat- ed. The relation between the continued fraction expansion of rational function and its 1- inear complexity profile is established. The expression of linear complexity profite is gi-~~en and a condition estimating the randomness of a sequence is presented. By the linear complexity profile, the bound of sphere complexity is proposed. A formula to record the number of sequences with given linear complexity profile is presented.

研究了周期序列的线性复杂度曲线特性，在周期序列生成函数的连分式展开式与线性复杂度曲线之间建立联系，给出了周期序列线性复杂度曲线的表达式；给出了判断序列随机性好坏的一个条件；利用线性复杂度曲线特性给出周期序列球体复杂度的一个估计；给出了具有给定线性复杂度曲线的序列个数的一个计数公式。

The representation of sequences is very helpful for the research of their linear complexity,so this paper we first research trace representation of periodic sequences,and the trace representation of a New Generalized Cyclotomic Sequence of order two of length pq is given,then for 2~mp~n period binary sequences,where p is an odd prime and 2 is a primitive root modulo p~2,we present a relation-ship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity and have the upper bound and lower bound of the value k, finally we discuss the k-error linear complexity of legendre sequences,also have the upper bound and lower bound of the value k,and discusses the situation where the linear complexity drop again for some Legendre sequences.

序列的表达形式对于其线性复杂度的研究是十分有帮助的，本文我们首先研究的是周期序列的迹表示，给出了2阶pq长度的扩展分圆序列的迹表示，然后讨论了周期为2~mp~n(m≥2)序列的线性复杂度与使得线性复杂度变小的最小的k值的关系，给出了k值的上界和下界，这里p为奇素数，2是模p~2的本原根，并通过例子讨论了其线性复杂度的稳定性，最后对Legendre序列k-错线性复杂度进行了分析，也给出了k值的上界和下界，并对某些Legendre序列讨论了线性复杂度再次下降的情况。

与complexity of things相关的网络解释 [注：此内容来源于网络，仅供参考]

Cyclomatic complexity：环路复杂性

复杂思维:complexity thinking way | 环路复杂性:Cyclomatic Complexity | 编码复杂度:Encoding complexity

computational complexity：时间复杂度

图块繁简度:figure complexity | 时间复杂度:Computational complexity. | 空间复杂性:spatial complexity

Complexity Regularization：复杂度规范化

复杂性思维:the Complexity Thinking | 复杂度规范化:Complexity Regularization | 建筑的复杂性:architecture"s complexity