For its founding, the Faculty of Liberal Arts of the Norwegian Academy of Sciences awarded the so-called “Nobel Prize in Mathematics” to László Lovász of Eötvös Loránd University in Budapest (Hungary) and Avi Wigderson of the Institute for Advanced Study in Princeton (USA). Contributions to theoretical computing science and discrete mathematics, and their prominent role in shaping them as the core area of modern mathematics. “
This Theoretical Computing Science (TCSIt uses two sub-disciplines to study the capabilities and challenges of computing: algorithm design to solve computing problems; and computational complexity, which shows the inherent limitations of the efficiency of these algorithms.
Discrete structures (such as graphics, strings, and permutations) are the basis of TCS and are therefore closely related to mathematics. These two areas are mutually beneficial. The application, concept and technology of the former opened up new research and solved important open problems in pure mathematics and applied mathematics.
In this case, the Hungarian mathematician László Lovász (Budapest, 1948) and the Israelis Avi Wigderson (Haifa, 1956) is the one who has led these developments in recent decades, Abel Prize This year is considered the “Nobel Prize in Mathematics.”
It was announced by today Norwegian Academy of Sciences, He was awarded “for his fundamental contributions to theoretical computational science and discrete mathematics, and for his outstanding role in shaping it into the core area of modern mathematics.”
The works of the winners are intertwined in many ways, especially both of which provide a fundamental contribution to understanding. Randomness in calculation And explore Limitations of efficient computing.
Advances in cryptography
Junto con Arjen Lenstra and Hendrik Lenstra, Laszlo, Vinculado Lorend University of Budapest (Hungary), developed the so-called Lattice reduction algorithm LLL (Lenstra – Lenstra – Lovás), one of the favorite tools of cryptanalysis experts, because it can successfully break through various proposed cryptographic systems.
The analysis of the algorithm is also used to design and ensure safety. Password system Newer lattice-based devices seem to even withstand attacks from quantum computers. This is just one of the contributions of the Hungarian mathematician, who also helped solve various mathematical problems related to the fields of graphics and combinatorics.
As far as he is concerned, Avi Wigderson is a researcher at the institute Princeton Institute for Advanced Study (United States), has made important contributions to all aspects of computational complexity, especially the role of randomness in calculations. Random algorithm is an algorithm that “flips the coin” to calculate the correct solution with a high probability.
Wigderson’s work makes it possible to construct a pseudo-random generator that converts some truly random bits into many pseudo-random bits. These are almost perfect random bit “extractors” from imperfect randomness sources or certain patterns.
Like other authors, he has made contributions in various aspects, such as developing a method of navigating the “maze” in consideration of intersection points or within the lower limits of communication protocol and circuit efficiency.
Thanks to the leadership of Lovász and Wigderson, discrete mathematics and the relatively young field of theoretical computing science have established themselves as the central field of modern mathematics.