Karl Bringmann. Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014. pages 661-670, IEEE Computer Society, 2014. [doi]
@inproceedings{Bringmann14, title = {Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails}, author = {Karl Bringmann}, year = {2014}, doi = {10.1109/FOCS.2014.76}, url = {http://dx.doi.org/10.1109/FOCS.2014.76}, researchr = {https://researchr.org/publication/Bringmann14}, cites = {0}, citedby = {0}, pages = {661-670}, booktitle = {55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014}, publisher = {IEEE Computer Society}, isbn = {978-1-4799-6517-5}, }