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). ACM Transactions on Algorithms, 16(4), 2020. [doi]

@article{BringmannGMW20,
  title = {Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)},
  author = {Karl Bringmann and Pawel Gawrychowski and Shay Mozes and Oren Weimann},
  year = {2020},
  doi = {10.1145/3381878},
  url = {https://doi.org/10.1145/3381878},
  researchr = {https://researchr.org/publication/BringmannGMW20},
  cites = {0},
  citedby = {0},
  journal = {ACM Transactions on Algorithms},
  volume = {16},
  number = {4},
}