Re: Two-dimensional pattern matching/compression

At least it seems to be in NP, a nondeterministic Turing machine could provide the smallest area *g*

I guess it would not be a really clever approach to build hash keys with any possible match of the supermatrix, which input matrices would check based on their own hashes: the supermatrix' hashes grow exponential as input is added, and since storage isn't infinite...

Still open for any input.

--
http://herbert.wikispaces.com
.