MathDB1 problem
- 0 votes0 replies0 views
Approximate matching conjecture for near-linear Lempel–Ziv lossy compression
Approximate matching conjecture. The approximate matching procedure could reduce the algorithm's complexity from quadratic time to linear time, up to logarithmic factors, without s…