July 06, 2020 article Open access Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can) ACM Transactions on Algorithms DOI: 10.1145/3381878 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 0 stored of 34 References 1 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Fine-grained Complexity Analysis of Two Classic TSP Variants 2020 ACM Transactions on Algorithms article Computer Science Complexity and Algorithms in Graphs Open access 17 citations 1 result