RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika

Diskr. Mat., 2002, Volume 14, Issue 1, Pages 114–141 (Mi dm226)

On the functional complexity of a two-dimensional interval search problem
È. È. Gasanov, I. V. Kuznetsova

This publication is cited in the following articles:
  1. E. E. Gasanov, “Information storage and search complexity theory”, J. Math. Sci., 168:1 (2010), 32–48  mathnet  crossref  mathscinet
  2. È. È. Gasanov, A. N. Erokhin, “A nonexhaustive algorithm, linear with respect to memory, for solving a two-dimensional interval search problem”, Discrete Math. Appl., 14:6 (2004), 631–646  mathnet  crossref  crossref  mathscinet  zmath


© Steklov Math. Inst. of RAS, 2026