Since the introduction of the Kolmogorov complexity of binary sequences in the 1960s, there have been significant advancements in the topic of complexity measures for randomness assessment, which are of fundamental importance in theoretical computer science and of practical interest in cryptography. This survey reviews notable research from the past four decades on the linear, quadratic and maximum-order complexities of pseudo-random sequences and their relations with Lempel-Ziv complexity, expansion complexity, 2-adic complexity, and correlation measures.

翻译：自20世纪60年代二进制序列的Kolmogorov复杂度概念提出以来，面向随机性评估的复杂度度量研究取得了显著进展，这些度量在理论计算机科学中具有基础重要性，同时在密码学领域具有实际应用价值。本综述梳理了过去四十年间关于伪随机序列的线性复杂度、二次复杂度及最大阶复杂度的重要研究成果，并探讨了它们与Lempel-Ziv复杂度、扩张复杂度、2-adic复杂度及相关性度量之间的内在联系。