Coding complexity: the computational complexity of succinct descriptions
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 prob...
| Authors: | , , |
|---|---|
| Format: | report |
| Publication Date: | 1996 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/83108 |
| Online Access: | https://hdl.handle.net/2117/83108 |
| Access Level: | Open access |
| Keyword: | Complexity Sets of strings Descriptions Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Summary: | 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. |
|---|