A Lower Bound on Complexity of a Locator Cellular Automaton Solution for the Closest Neighbor Search Problem

IF 0.2 Q4 MATHEMATICS

Moscow University Mathematics Bulletin Pub Date : 2023-12-19 DOI:10.3103/s0027132223050078

D. I. Vasilev, E. E. Gasanov

引用次数: 0

Abstract

The paper considers the application of the locator cellular automaton model to the closest neighbor search problem. The locator cellular automaton model assumes the possibility for each cell to translate a signal through any distance using the ether. It was proven earlier that the ether model allows solving the problem with logarithmic time. In this paper we have derived a logarithmic lower bound for this problem.

查看原文本刊更多论文

近邻搜索问题的定位蜂窝自动机解法复杂度下限

摘要本文研究了定位器蜂窝自动机模型在近邻搜索问题中的应用。定位器蜂窝自动机模型假定每个蜂窝都有可能利用乙醚在任意距离内转换信号。早先的研究证明，乙醚模型可以用对数时间解决问题。在本文中，我们推导出了该问题的对数下限。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Moscow University Mathematics Bulletin MATHEMATICS-

CiteScore

0.60

自引率

25.00%

发文量

期刊介绍： Moscow University Mathematics Bulletin is the journal of scientific publications reflecting the most important areas of mathematical studies at Lomonosov Moscow State University. The journal covers research in theory of functions, functional analysis, algebra, geometry, topology, ordinary and partial differential equations, probability theory, stochastic processes, mathematical statistics, optimal control, number theory, mathematical logic, theory of algorithms, discrete mathematics and computational mathematics.