𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts

✍ Scribed by Piotr Berman; Marek Karpinski; Lawrence L. Larmore; Wojciech Plandowski; Wojciech Rytter


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
293 KB
Volume
65
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

✦ Synopsis


We consider the complexity of problems related to two-dimensional texts (2D-texts) described succinctly. In a succinct description, larger rectangular subtexts are defined in terms of smaller parts in a way similar to that


πŸ“œ SIMILAR VOLUMES