Cook, S.A. (2007) An Overview of Computational Complexity. ACM Turing Award Lectures. Association for Computing Machinery, New York.
https://doi.org/10.1145/1283920.1283938

has been cited by the following article:

• TITLE: Dimensional Complexity and Algorithmic Efficiency

  AUTHORS: Alexander Odilon Ngu

  KEYWORDS: Symbolic Intelligence, Dimensional Complexity, Algorithmic Efficiency, Notational Unification, Turing Complete Machine, Unified Theory

  JOURNAL NAME: International Journal of Modern Nonlinear Theory and Application, Vol.11 No.1, March 8, 2022

  ABSTRACT: This paper uses the concept of algorithmic efficiency to present a unified theory of intelligence. Intelligence is defined informally, formally, and computationally. We introduce the concept of dimensional complexity in algorithmic efficiency and deduce that an optimally efficient algorithm has zero time complexity, zero space complexity, and an infinite dimensional complexity. This algorithm is used to generate the number line.