首页> 外文OA文献 >A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube

【2h】

A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube

机译：在汉明立方体上近似最近邻搜索的复杂度下界

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Amit Chakrabarti; Bernard Chazelle; Benjamin Gum; Alexey Lvov;
展开▼
作者单位

展开▼
年度 1999
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems [J] . ANDRIS AMBAINIS, WILLIAM GASARCH, ARAVIND SRINIVASAN, ACM Transactions on Computational Theory . 2015,第3期

机译：汉明距离问题的确定性和量子通信复杂性的下界
2. An optimal lower bound on the communication complexity of gap-hamming-distance (Conference Paper) [J] . Chakrabarti A., Regev O. SIAM Journal on Computing . 2012,第5期

机译：间隙汉明距离通信复杂度的最佳下限（会议论文）
3. An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance [J] . Amit Chakrabarti, Oded Regev Electronic Colloquium on Computational Complexity . 2010,第195期

机译：间隙距离距离的通信复杂度的最优下界
4. A lower bound on the complexity of approximate nearest-neighbor searching on the hamming cube [C] . Amit Chakrabarti, Bernard Chazelle . 1999

机译：在汉明立方体上近似最近邻搜索的复杂度的下界
5. Connections Between Complexity Lower Bounds and Meta-computational Upper Bounds [D] . Carmosino, Marco Leandro. 2019

机译：复杂性下限与元计算上限之间的连接
6. Listeria monocytogenes Survey in Cubed Cooked Ham Packaged in Modified Atmosphere and Bioprotective Effect of Selected Lactic Acid Bacteria [O] . Lucilla Iacumin, Giorgia Cappellari, Andrea Colautti, 2020

机译：李斯特菌单核细胞质调查在改性气氛中包装的立方熟火腿和选定乳酸菌的生物选择作用
7. An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance [O] . Chakrabarti, Amit, Regev, Oded 2012

机译：通信复杂度的最优下界间隙海明距离

A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube

著录项

引文网络

相似文献

相关主题

期刊订阅