|
This article is cited in 4 scientific papers (total in 4 papers)
Instantaneously solvable search problems
È. È. Gasanov
Abstract:
We introduce a new class of algorithmic problems called the class of instantly
solvable search problems. The problems of this class can be solved,
in average, in a time needed to list the data forming the answer plus a constant
independent of the dimension of the problem. Examples of instantly
solvable search problems are given and the algorithms providing instant
solutions are described.
Citation:
È. È. Gasanov, “Instantaneously solvable search problems”, Diskr. Mat., 8:3 (1996), 119–134; Discrete Math. Appl., 6:5 (1996), 467–482
Linking options:
https://www.mathnet.ru/eng/dm532https://doi.org/10.4213/dm532 https://www.mathnet.ru/eng/dm/v8/i3/p119
|
Statistics & downloads: |
Abstract page: | 385 | Full-text PDF : | 213 | First page: | 1 |
|