Piotr Indyk. Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems. In Christian Scheideler, Mohammad Taghi Hajiaghayi, editors, Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. pages 1, ACM, 2017. [doi]
Abstract is missing.