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复杂度及相关性度量之间的关系。