Shachar Lovett “Point location with near-optimal bounds” | MLC ’20

The talk by Shachar Lovett (University of California San Diego, US) “Point location with near-optimal bounds“ that he made on the conference “Machine Learning and Combinatorics 2020“ at MIPT. Joint work with Max Hopkins, Daniel Kane and Gaurav Mahajan. Paper will appear in FOCS 2020. Arxiv: