English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

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

Bringmann, K., Gawrychowski, P., Mozes, S., & Weimann, O. (2020). Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). ACM Transactions on Algorithms, 16(4): 48. doi:10.1145/3381878.

Item is

Basic

show hide
Genre: Journal Article
Latex : Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless {APSP} can)

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bringmann, Karl1, Author                 
Gawrychowski, Paweł2, Author           
Mozes, Shay2, Author
Weimann, Oren2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2020
 Publication Status: Published online
 Pages: 22 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Bringmann_ToA2020
DOI: 10.1145/3381878
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: ACM Transactions on Algorithms
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: 22 p. Volume / Issue: 16 (4) Sequence Number: 48 Start / End Page: - Identifier: ISSN: 1549-6325
CoNE: https://pure.mpg.de/cone/journals/resource/111088195282718