M. Aldaz, J. Heintz, G. Matera, J. L. Monta?a and L. M. Pardo, “Time-Space Tradeoffs in Algebraic Complexity Theory,” Journal of Complexity, Vol. 16, No. 1, 1998, pp. 2-49. doi:10.1006/jcom.1999.0526

has been cited by the following article:

• TITLE: Document Clustering with Evolutionary Systems through Straight-Line Programs “slp”

  AUTHORS: José Luis Castillo Sequera, José Raúl Fernández del Castillo Diez, León Gonzalez Sotos

  KEYWORDS: Clustering; Genetic Algorithm; Data Mining; Straight Line Programs

  JOURNAL NAME: Journal of Intelligent Learning Systems and Applications, Vol.4 No.4, November 28, 2012

  ABSTRACT: In this paper, we show a clustering method supported on evolutionary algorithms with the paradigm of linear genetic programming. “The Straight-Line Programs (slp)”, which uses a data structure which will be useful to represent collections of documents. This data structure can be seen as a linear representation of programs, as well as representations in the form of graphs. It has been used as a theoretical model in Computer Algebra, and our purpose is to reuse it in a completely different context. In this case, we apply it to the field of grouping library collections through evolutionary algorithms. We show its efficiency with experimental data we got from traditional library collections.