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):
Displaying 13 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)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Protecting elections by recounting ballots (Q2046043) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
- Equality Testing of Compressed Strings (Q3449353) (← links)
- Linear pattern matching of compressed terms and polynomial rewriting (Q4585011) (← links)
- Rewriting recursive aggregates in answer set programming: back to monotonicity (Q4592997) (← links)
- Parallel identity testing for skew circuits with big powers and applications (Q4687480) (← links)
- Identity testing for radical expressions (Q6649437) (← links)
