On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product

Lijie Chen. On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. In Rocco A. Servedio, editor, 33rd Computational Complexity Conference, CCC 2018, June 22-24, 2018, San Diego, CA, USA. Volume 102 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Abstract

Abstract is missing.