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