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年代二进制序列的柯尔莫哥洛夫复杂度被提出以来，用于随机性评估的复杂度测度研究取得了显著进展，该领域在理论计算机科学中具有基础重要性，并在密码学中具有实际应用价值。本综述回顾了过去四十年来关于伪随机序列的线性复杂度、二次复杂度及最大阶复杂度的重要研究，并探讨了这些复杂度与Lempel-Ziv复杂度、扩展复杂度、2进复杂度及相关性测度之间的关系。