Why Walking the Dog Takes Time: Frechet Distance Has no Strongly Subquadratic 
Algorithms Unless SETH Fails

Bringmann, Karl

doi:10.1109/FOCS.2014.76

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Why Walking the Dog Takes Time: Frechet Distance Has no Strongly Subquadratic Algorithms Unless SETH Fails

MPS-Authors

/persons/resource/persons44182

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

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bringmann, K. (2014). Why Walking the Dog Takes Time: Frechet Distance Has no Strongly Subquadratic Algorithms Unless SETH Fails. In R. Bilof, & M. Bartosik (Eds.), FOCS 2014 (pp. 661-670). Los Alamitos, CA: IEEE Computer Society. doi:10.1109/FOCS.2014.76.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-41D7-A

Abstract

There is no abstract available