Lower bound on the complexity of approximate nearest-neighbor searching on the hamming cube

Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov

Research output: Contribution to journalConference articlepeer-review

33 Scopus citations

Fingerprint

Dive into the research topics of 'Lower bound on the complexity of approximate nearest-neighbor searching on the hamming cube'. Together they form a unique fingerprint.

Keyphrases

Mathematics