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.
CitationBalcazar, J. L., Gavaldà, R., Watanabe, O. "Coding complexity: the computational complexity of succinct descriptions". 1996.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org