The complexity of problems related to two-dimensional texts is discussed. In a succinct description, larger rectangular subtexts are defined in terms of smaller parts in a way similar to that of Lemped-Ziv compression for 1D-text, or in string with shortned descriptions as in hierarchical graphs described by context-free graph grammars. The complexity increase in a 2D setting. It has been also shown that the compressed size of subrectangle of a compressed 2D array can grow exponentially, unlike the 1D case.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics