|
Fundamentalnaya i Prikladnaya Matematika, 2009, Volume 15, Issue 3, Pages 49–73
(Mi fpm1228)
|
|
|
|
Information storage and search complexity theory
E. E. Gasanov M. V. Lomonosov Moscow State University
Abstract:
We propose a new information-graph model for information storage and search. This model generalizes a number of known data representation models. We study the main properties of the proposed model. We solve the problem of optimal informational graph synthesis for a wide class of search problems including the most acute database search problems.
Citation:
E. E. Gasanov, “Information storage and search complexity theory”, Fundam. Prikl. Mat., 15:3 (2009), 49–73; J. Math. Sci., 168:1 (2010), 32–48
Linking options:
https://www.mathnet.ru/eng/fpm1228 https://www.mathnet.ru/eng/fpm/v15/i3/p49
|
Statistics & downloads: |
Abstract page: | 732 | Full-text PDF : | 385 | References: | 57 | First page: | 1 |
|