|
A fast algorithm for solving a simple search problem
V. N. Malozemov, G. Sh. Tamasyan St. Petersburg State University, St. Petersburg, 199034 Russia
Abstract:
A fast algorithm for solving the Danskin problem is proposed. The dependence of its solution on parameters is analyzed.
Key words:
simple search problem, Gibbs lemma, fast algorithm, dependence of solution on parameters.
Received: 23.03.2018 Revised: 11.01.2019 Accepted: 11.01.2019
Citation:
V. N. Malozemov, G. Sh. Tamasyan, “A fast algorithm for solving a simple search problem”, Zh. Vychisl. Mat. Mat. Fiz., 59:5 (2019), 905–910; Comput. Math. Math. Phys., 59:5 (2019), 851–856
Linking options:
https://www.mathnet.ru/eng/zvmmf10902 https://www.mathnet.ru/eng/zvmmf/v59/i5/p905
|
Statistics & downloads: |
Abstract page: | 412 | References: | 30 |
|