Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Künnemann, Marvin Algorithms and Complexity, MPI for Informatics, Max Planck Society;
https://proceedings.neurips.cc/paper/2020/hash/645e6bfdd05d1a69c5e47b20f0a91d46-Abstract.html (Preprint)
Abboud, A., Backurs, A., Bringmann, K., & Künnemann, M. (2020). Impossibility Results for Grammar-Compressed Linear Algebra. In H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, & H. Lin (Eds.), Advances in Neural Information Processing Systems 33 (pp. 8810-8823). Curran Associates, Inc.