Any system of square-submatrix equality constraints on an m by n matrix can be solved in O(|E|+mn) time, giving optimal O(b+mn) decompression of 2D square macro schemes.
The landscape of compressibility measures for two-dimensional data.IEEE Access, 12:87268–87283, 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Solving Square-Submatrix Equation Systems
Any system of square-submatrix equality constraints on an m by n matrix can be solved in O(|E|+mn) time, giving optimal O(b+mn) decompression of 2D square macro schemes.