Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made

Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams. Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made. In Daniel Wichs, Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. pages 375-388, ACM, 2016. [doi]

Abstract

Abstract is missing.