3 ms·
That's really interesting and seems like it could (in theory) work, though it would be challenging and time consuming to actually compress data this way.
by ALittleLight 7y ago
That's really interesting and seems like it could (in theory) work, though it would be challenging and time consuming to actually compress data this way.
- 1-more 7y agooh yeah like the paper says it's doing SAT a lot of times. Nearest I can tell the time complexity for each bit of the output is O(n!) where n is the size of the (unknown and you are solving for it) input bit pattern. So total time complexity is something like O(n! * w_n * h_n) which is BIG and stupid and might make this actually not a way to beat the optimum compression ratio dictated by entropy.