A Lower Bound on Complexity of a Locator Cellular Automaton Solution for the Closest Neighbor Search Problem
Crossref DOI link: https://doi.org/10.3103/S0027132223050078
Published Online: 2023-12-19
Published Print: 2023-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Vasilev, D. I.
Gasanov, E. E.
Text and Data Mining valid from 2023-10-01
Version of Record valid from 2023-10-01
Article History
Received: 15 March 2023
First Online: 19 December 2023
CONFLICT OF INTEREST
: The authors of this work declare that they have no conflicts of interest.