Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > MAXIMUM INNER PRODUCT:
Reports tagged with Maximum Inner Product:
TR18-026 | 7th February 2018
Lijie Chen

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

Revisions: 1

In this paper we study the (Bichromatic) Maximum Inner Product Problem (Max-IP), in which we are given sets $A$ and $B$ of vectors, and the goal is to find $a \in A$ and $b \in B$ maximizing inner product $a \cdot b$. Max-IP is very basic and serves ... more >>>

ISSN 1433-8092 | Imprint