Search
Now showing items 1-3 of 3
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
(Society for Industrial & Applied Mathematics (SIAM), 2018-01)
© 2018 Society for Industrial and Applied Mathematics. Due to the lack of unconditional polynomial lower bounds, it is now in fashion to prove conditional lower bounds in order to advance our understanding of the class P. ...
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)
(Society for Industrial & Applied Mathematics (SIAM), 2018-01)
© 2018 Society for Industrial and Applied Mathematics. The edit distance (a.k.a. the Levenshtein distance) between two strings is defined as the minimum number of insertions, deletions, or substitutions of symbols needed ...
An introduction to data representation synthesis
(Association for Computing Machinery (ACM), 2012-12)
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is declarative and results in provably correct code. In our approach, abstract data types are specified using ...