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

Published in: Computational Complexity Conference (2018)

Keyphrases

exact solution
exact and approximate
exact computation
phase transition
information theoretic
learning theory
support vector machine
approximate matches
np complete
maximum number
brute force
exact answers
reverse k nearest neighbor
quality guarantees
graphical models
multi dimensional
worst case