Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)
Karl Bringmann
, Pawe Gawrychowski
, Shay Mozes
,
Oren Weimann
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Tree Edit Distance
100%
Subcubic
100%
String Edit Distance
50%
All-pairs Shortest Paths
25%
Time Algorithm
12%
Dynamic Programming
12%
Programming Solution
12%
New Nodes
12%
Strong Exponential Time Hypothesis
12%
Edit Distance
12%
Elementary Operation
12%
Maximum Weight
12%
Minimum Cost
12%
Delabeling
12%
Conditional Lower Bounds
12%
Rooted Ordered Trees
12%
Dynamic Programming Problem
12%
Computer Science
Dynamic Programming
100%
Pair Shortest Path Problem
50%
Pair Shortest Path
50%