Coding complexity: the computational complexity of succinct descriptions

Consultar RECERCAT

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/83108

Título:	Coding complexity: the computational complexity of succinct descriptions
Autor/a:	Balcázar Navarro, José Luis; Gavaldà Mestre, Ricard; Watanabe, Osamu
Otros autores:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
Abstract:	For a given set of strings, the problem of obtaining a succinct description becomes an important subject of research, related to several areas of theoretical computer science. In structural complexity theory, researchers have developed a reasonable framework for studying the complexity of these problems. In this paper, we survey how such investigation has proceeded, and explain the current status of our knowledge.
Materia(s):	-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Complexity -Sets of strings -Descriptions
Derechos:
Tipo de documento:	Artículo - Versión publicada Informe
Compartir:

Balcázar Navarro, José Luis; Díaz Cort, Josep; Gavaldà Mestre, Ricard; Watanabe, Osamu

Domingo Soriano, Carlos; Gavaldà Mestre, Ricard; Watanabe, Osamu

Domingo Soriano, Carlos; Gavaldà Mestre, Ricard; Watanabe, Osamu

Gavaldà Mestre, Ricard; Watanabe, Osamu

Balcázar Navarro, José Luis; Gavaldà Mestre, Ricard; Hermo Huguet, Montserrat

Coordinación

Patrocinio