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]
@inproceedings{AbboudHWW16,
title = {Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made},
author = {Amir Abboud and Thomas Dueholm Hansen and Virginia Vassilevska Williams and Ryan Williams},
year = {2016},
doi = {10.1145/2897518.2897653},
url = {http://doi.acm.org/10.1145/2897518.2897653},
researchr = {https://researchr.org/publication/AbboudHWW16},
cites = {0},
citedby = {0},
pages = {375-388},
booktitle = {Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016},
editor = {Daniel Wichs and Yishay Mansour},
publisher = {ACM},
isbn = {978-1-4503-4132-5},
}