Coding complexity: the computational complexity of succinct descriptions

dc.contributor.author	Balcázar Navarro, José Luis
dc.contributor.author	Gavaldà Mestre, Ricard
dc.contributor.author	Watanabe, Osamu
dc.contributor.other	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned	2016-02-18T12:23:42Z
dc.date.available	2016-02-18T12:23:42Z
dc.date.issued	1996-09
dc.identifier.citation	Balcazar, J. L., Gavaldà, R., Watanabe, O. "Coding complexity: the computational complexity of succinct descriptions". 1996.
dc.identifier.uri	http://hdl.handle.net/2117/83108
dc.description.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.
dc.format.extent	23 p.
dc.language.iso	eng
dc.subject	Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.other	Complexity
dc.subject.other	Sets of strings
dc.subject.other	Descriptions
dc.title	Coding complexity: the computational complexity of succinct descriptions
dc.type	External research report
dc.rights.access	Open Access
local.identifier.drac	1837771
dc.description.version	Postprint (published version)
local.citation.author	Balcazar, J. L.; Gavaldà, R.; Watanabe, O

UPCommons. Portal del coneixement obert de la UPC