This article is cited 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.

UDC: 517.977

DOI: 10.4213/dm532

 English version: Discrete Mathematics and Applications, 1996, 6:5, 467–482

Bibliographic databases:

• 
•