Pages that link to "Item:Q1872708"
From MaRDI portal
The following pages link to On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708):
Displayed 5 items.
- Fast equality test for straight-line compressed strings (Q436321) (← links)
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression. (Q1401326) (← links)
- The complexity of compressing subsegments of images described by finite automata (Q1861562) (← links)
- Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
- Equality Testing of Compressed Strings (Q3449353) (← links)