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

References

1. Selton G., Avtomaticheskaya obrabotka, khranenie i poisk informatsii, Sov. radio, Moskva, 1973
2. Gasanov E. E., “Nizhnyaya otsenka slozhnosti informatsionnykh setei dlya odnogo otnosheniya chastichnogo poryadka”, Diskretnaya matematika, 8:4 (1996), 108–122  mathnet  mathscinet  zmath
3. Gasanov E. E., “Nizhnyaya otsenka slozhnosti vklyuchayuschego poiska v klasse drevovidnykh skhem”, Diskretnaya matematika, 10:1 (1998), 63–72  mathnet  mathscinet  zmath
4. Gasanov E. E., Kosolapov A. V., “K voprosu o drevovidnosti optimalnykh informatsionnykh setei vklyuchayuschego poiska”, Intellektualnye sistemy, 3:1–2 (1998), 167–192
5. Gasanov E. E., “Ob odnomernoi zadache intervalnogo poiska”, Diskretnaya matematika, 7:2 (1995), 40–60  mathnet  mathscinet  zmath
6. Gavrilov G. P., Sapozhenko A. A., Zadachi i uprazhneniya po kursu diskretnoi matematiki, Nauka, Moskva, 1992  mathscinet  zmath
7. Gasanov E. E., “Ob odnoi matematicheskoi modeli informatsionnogo poiska”, Diskretnaya matematika, 3:2 (1991), 69–76  mathnet  mathscinet  zmath


© Steklov Math. Inst. of RAS, 2025