|Generate QR code
Open Access
Subscription Access
How to choose the right one from 100,000,000,000 options if you only have time to sort through 100 of them?
Abstract
It is the final part of the article by Belarusian mathematicians, that allows you to understand the main thing about life and mathematics, i. e., why the simplest thing is the most complex, and also whether it is possible to take over the world with the help of one equation.
About the Authors
V. Sarvanov
Institute of Mathematics
Belarus
Belarus
Vladimir Sarvanov, Leading researcher, Candidate of Physical and Mathematical Sciences
Department of Number Theory and Discrete Mathematics
Minsk
E. Makarov
Institute of Mathematics
Belarus
Belarus
Evgeny Makarov, head of the Department, Doctor of Physical and Mathematical Sciences, Professor
Department of Differential Equations
Minsk
References
1. D.B. Shmoys, J.K. Lenstra, A.H.G. Rinnooy Kan, E.L. Lawler. The Traveling Salesman Problem (A guided tour of combinatorial optimisation) – Chichester, 1985.
2. Dantzig G.B., Fulkerson R., Johnson S.M. Solution of a large-scale traveling salesman problem // Operations Research. 1954. Vol. 2 (4). Р. 393–410.
3. Фортноу Л. Золотой билет. P, NP и границы возможного. – М., 2016.
4. Как захватить мир, доказав, что P=NP // https://habr.com/ru/post/227687/.
Review
For citations:
Sarvanov V., Makarov E. How to choose the right one from 100,000,000,000 options if you only have time to sort through 100 of them? Science and Innovations. 2024;(5):51-57. (In Russ.)
Views: 60
Email this article 