Instantaneously solvable search problems
Diskretnaya Matematika, Tome 8 (1996) no. 3, pp. 119-134
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
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.