Nevanlinna Prize

The Nevanlinna Prize, officially Rolf Nevanlinna Prize in Mathematical Aspects of Information Sciences ( German: Rolf Nevanlinna Prize in mathematical areas of computer science ), is awarded by the International Mathematical Union for outstanding work in the field of theoretical computer science. He will be handed over along with the Fields Medal and the Carl Friedrich Gauss Prize at the International Congress of Mathematicians held every four years.

The award, which is named after the Finnish mathematician Rolf Nevanlinna Herman and consists of a gold medal and a cash prize is awarded since 1982.

Principles of ceremony

The provisions are similar to those of the Fields Medal: The Executive Committee of the IMU determines the selection committee, whose members remain secret except the Chairman until the award ceremony. In addition, the award winner must before 1 January of the year in which he is honored to have been younger than 40 years.

The medal

The medal is made ​​of gold and was developed by the Finnish sculptor Raimo Heino (1932-1995) designed. On the front of the head of Nevanlinna is shown in profile, along with the inscription " Rolf Nevanlinna Prize" and a small logo " RH" are over "83", the artist's initials and the year of 1983, in which the first medal was coined. The back shows two symbols of the University of Helsinki, top left, the word "Helsinki" in coded form, right down the university seal with the inscription " VNIVERSITAS HELSINGIENSIS ". On the edge of the name of the laureate is engraved.

Award winners

  • For his work on algebraic complexity theory to efficient stochastic algorithms evaluated and artificial intelligence
  • For his work on the lower bound of the complexity of circuits
  • For contributions to the verification of secret evidence in detail with stochastic criteria ( interactive proofs ) and their application in computer networks
  • For a polynomial-time algorithm for factoring integers on a quantum computer ( Shor algorithm) and other contributions to quantum computer science
  • For contributions to probabilistically checkable proofs, non- approximability of optimization problems and error-correcting codes
  • For contributions to the mathematical theory of global information environment ( among other things, to improve search engines and Internet routing )
Alexander Razborov Avi Wigderson Interactive proof system Peter Shor Time complexity#Polynomial time Shor's algorithm Quantum information science Madhu Sudan Jon Kleinberg
599746
de