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]
@inproceedings{Chen18-35, title = {On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product}, author = {Lijie Chen}, year = {2018}, doi = {10.4230/LIPIcs.CCC.2018.14}, url = {https://doi.org/10.4230/LIPIcs.CCC.2018.14}, researchr = {https://researchr.org/publication/Chen18-35}, cites = {0}, citedby = {0}, booktitle = {33rd Computational Complexity Conference, CCC 2018, June 22-24, 2018, San Diego, CA, USA}, editor = {Rocco A. Servedio}, volume = {102}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-95977-069-9}, }