Lower estimate of complexity in the problem of searching the nearest neighbor on a straight line using a cellular automation with locators
    
    
  
  
  
      
      
      
        
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2023), pp. 33-39
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			The paper considers the application of the locator cellular automaton model to the closest neighbour 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 us to solve the problem with logarithmic time. In this paper we have derived a logarithmic lower bound for this problem.
			
            
            
            
          
        
      @article{VMUMM_2023_5_a4,
     author = {D. I. Vasilyev and \`E. \`E. Gasanov},
     title = {Lower estimate of complexity in the problem of searching the nearest neighbor on a straight line using a cellular automation with locators},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {33--39},
     publisher = {mathdoc},
     number = {5},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2023_5_a4/}
}
                      
                      
                    TY - JOUR AU - D. I. Vasilyev AU - È. È. Gasanov TI - Lower estimate of complexity in the problem of searching the nearest neighbor on a straight line using a cellular automation with locators JO - Vestnik Moskovskogo universiteta. Matematika, mehanika PY - 2023 SP - 33 EP - 39 IS - 5 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VMUMM_2023_5_a4/ LA - ru ID - VMUMM_2023_5_a4 ER -
%0 Journal Article %A D. I. Vasilyev %A È. È. Gasanov %T Lower estimate of complexity in the problem of searching the nearest neighbor on a straight line using a cellular automation with locators %J Vestnik Moskovskogo universiteta. Matematika, mehanika %D 2023 %P 33-39 %N 5 %I mathdoc %U http://geodesic.mathdoc.fr/item/VMUMM_2023_5_a4/ %G ru %F VMUMM_2023_5_a4
D. I. Vasilyev; È. È. Gasanov. Lower estimate of complexity in the problem of searching the nearest neighbor on a straight line using a cellular automation with locators. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2023), pp. 33-39. http://geodesic.mathdoc.fr/item/VMUMM_2023_5_a4/
