Nobel Prize in Mathematics for pioneers of theoretical computational sciences

Madrid, March 17th (Europe Press) –

Norwegian Academy of Sciences and Letters He received the Abel Prize 2021 to László Lovász from Eötvös Loránd University and Avi Wigderson from the Institute for Advanced Study in Princeton.

The jury awards them this award – He is considered a “noble” in mathematics – “for them Fundamental contributions to theoretical computational science and discrete mathematicsAnd thus recognition of their pre-eminent role in making them central fields of modern mathematics.

According to the academy It is a statementThe theory of “computational complexity”, which deals with the speed and efficiency of algorithms, was born in the 1970s and has become an established field of both mathematics and theoretical computational science. It is currently an area of ​​great interest that provides the theoretical basis for Internet security.

The works of Laszlo Lovache and Avi Wedgadros played an important role in this development. Luvas and Weddersson have driven this progress over the past decades; their work is intertwined in many ways, and the two in particular She contributed greatly to understanding randomness in computing and exploring the frontiers of efficient computingThis was explained by Hans Monte-Cass, Chairman of the Appel Committee.

As Munthe-Kaas points out, thanks to the innovative work of both, discrete mathematics and the relatively small field of theoretical computation have established themselves as central areas of modern mathematics.

Endowed Abel Prize 7.5 million Norwegian kroner (about 740,000 euros).

LÁSZLÓ LOVÁSZ

One of the main repercussions of Lovász’s work (Hungary, 1948) Determine how discrete mathematics can address fundamental theoretical questions in computer science. In addition to his work on the primary support of computer science, Lovász has also created powerful algorithms with a variety of applications.

One of them, the LLL algorithm, named after Lovász and the brothers Arjen and Hendrik Lenstra, has represented a conceptual advance in understanding synapses and has remarkable applications in areas such as number theory, coding, and computation. Currently, the only known cryptographic systems that are able to resist a quantum computer attack are based on the LLL algorithm.

Lovász has won several awards, including the 1999 Wolf Prize, the 1999 Knuth Prize, the 2001 Gödel Prize, and the 2010 Kyoto Prize. In addition, he was President of the International Mathematics Federation between 2007 and 2010.

Avi Wedderon

As the Academy highlights, the contribution of Wijderson (Israel, 1956) in expanding and deepening the field of “complexity theory” is “He is probably better than everyone else.”

Wijderson developed a paper on major open problems in complexity theory. He co-authored articles with over 100 people and delved into the links between mathematics and computer science.

Cryptography on the Internet is the most important application of complexity theory today. Early in his career, Weddersoon made fundamental contributions to the field, such as the zero-knowledge offering, currently used in cryptocurrency technology

In 1994, Wigderson was awarded the Rolf Nevanlinna Prize for Computer Science. Among his many other prizes are the 2009 Gödel Prize and the 2019 Knuth Prize.