NeurIPS 2020Poster
Impossibility Results for Grammar-Compressed Linear Algebra
作者: Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
摘要
To handle vast amounts of data, it is natural and popular to compress vectors and matrices. When we compress a vector from size N down to size n << N, it certainly makes it easier to store and transmit efficiently, but does it also make it easier to process?