RUS
ENG
Full version
JOURNALS
// Diskretnaya Matematika
Diskr. Mat.,
2000
, Volume 12,
Issue 2,
Pages
118–139
(Mi dm329)
Estimates for the complexity of a method for solving the problem of inclusive search
È. È. Gasanov
This publication is cited in the following articles:
T. D. Blaivas, “The Shannon function of the complexity of interval search on a Boolean cube in the class of trees”,
Discrete Math. Appl.
,
16
:3 (2006),
259–270
©
Steklov Math. Inst. of RAS
, 2025