Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)

Backurs, Arturs; Indyk, Piotr

doi:10.1145/2746539.2746612

Record: found
Abstract: not found
Conference Proceedings: not found

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)

proceedings-article

Author(s): Arturs Backurs , Piotr Indyk

Publication date (Print): 2015

Conference name: the Forty-Seventh Annual ACM (STOC '15)

Conference date: July 14, 2015 - July 17, 2015

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Conference

Publication date (Print): 2015

Pages: 51-58

Article

DOI: 10.1145/2746539.2746612

SO-VID: 9bc9b90b-59ed-4c9d-a015-ae5e0b2ccbdd

License:

http://www.acm.org/publications/policies/copyright_policy#Background

Conference name: the Forty-Seventh Annual ACM

Conference acronym: STOC '15

Conference number: 47

Conference location: Portland, Oregon, USA

Conference date: July 14, 2015 - July 17, 2015

Conference sponsor: SIGACT, ACM Special Interest Group on Algorithms and Computation Theory

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)

Read this article at

Related collections

2023 Research and Innovation Open Distance and eLearning (ODeL) Hybrid Conference

Author and article information

Conference

Article

History

Comments

Comment on this article

Similar content 2,306

Cited by 41