de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., Gawrychowski, P., Mozes, S., & Weimann, O. (2018). Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). In A. Czumaj (Ed.), SODA'18 (pp. 1190-1206). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975031.77.


Cite as: http://hdl.handle.net/21.11116/0000-0000-3F13-5
Abstract
There is no abstract available