| Article Details | ||
|---|---|---|
| Title: | Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made | |
| Article URLs: | ||
| Alternative Article URLs: | ||
| Authors: | Amir Abboud |
|
| Thomas Dueholm Hansen |
|
|
| Virginia Vassilevska Williams |
|
|
| Ryan Williams |
|
|
| Sharing: | Unknown | |
| Verification: | Authors have not verified information | |
| Artifact Evaluation Badge: | none | |
| Artifact URLs: |
|
|
| Artifact Correspondence Email Addresses: |
|
|
| NSF Award Numbers: | 1417238, 1514339, 1212372 | |
| DBLP Key: | conf/stoc/AbboudHWW16 | |
| Author Comments: | ||