Probabilistic analysis and optimization of search algorithms
Dobromir P. Kralchev · Asian-European Journal of Mathematics · 2024
An interesting phenomenon about search algorithms is theoretically explained. Exponential optimization of running times has been achieved: the bigger the input size, the greater the acceleration. The optimization is equally applicable to exhaustive search, backtracking, and stochastic search.