Dylan M. McKay, Cody D. Murray, R. Ryan Williams. Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. In Moses Charikar, Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. pages 1215-1225, ACM, 2019. [doi]
Abstract is missing.