Coding Complexity: The Computational Complexity of Succinct Descriptions

José L. Balcázar (), Ricard Gavaldà () and Osamu Watanabe ()
Additional contact information
José L. Balcázar: Universitat Politècnica de Catalunya, Department of Software (LSI)
Ricard Gavaldà: Universitat Politècnica de Catalunya, Department of Software (LSI)
Osamu Watanabe: Tokyo Institute of Technology, Department of Computer Science

A chapter in Advances in Algorithms, Languages, and Complexity, 1997, pp 73-91 from Springer

Abstract: 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.

Keywords: Turing Machine; SIAM Journal; Kolmogorov Complexity; Code Complexity; Equivalence Query (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-3394-4_3

Ordering information: This item can be ordered from
http://www.springer.com/9781461333944

DOI: 10.1007/978-1-4613-3394-4_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().