Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)

Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann. Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. pages 1190-1206, SIAM, 2018. [doi]

Abstract

Abstract is missing.