Skip to main navigation Skip to search Skip to main content

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

Research output: Contribution to journalConference articlepeer-review

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.
Sort by

Mathematics

Keyphrases