DOCSLIB.ORG

2021 Abel Prize

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
2021 Abel Prize NEWS 2021 Abel Prize The Norwegian Academy of Science and knowledge’ (see ref. 3). The class P con- countries. The WSF also serves as a venue Letters in Oslo, Norway has awarded the sists of problems which can be solved for the award ceremonies of the two Abel Prize for 2021 to László Lovász, efficiently in a reasonable time whereas prestigious awards namely the UNESCO Hungary and Avi Wigderson, USA. The the class NP consists of problems, whose Kalinga Prize for the Popularization of prize has a cash award of 7.5 million solutions can be efficiently verified. To Science and the UNESCO Sultan Qaboos Norwegian kroner (USD 870,000). In the date, it is not known if NP is equal to N. Prize for Environmental Conservation6 1970s, when Wigderson and Lovász Lovász was born in 1948 in Hungary. respectively. commenced their careers, theoretical He is at the Eötvös Loránd University in The Abel Prize was instituted in 2001 computer science and pure mathematics Budapest, Hungary. Influenced by the in honour of the Norwegian mathemati- were almost entirely distinct disciplines. legendary mathematician Paul Erdős cian Niels Henrik Abel (1802–1829). Now, the two disciplines are interwoven, (whom he met in 1963), Lovász started Along with the Fields Medal (first given with many contributions coming from his journey of prolific publications in in 1936), the Abel Prize is considered to the duo complementing each other. The 1965 with several single-author papers be the highest award in mathematics. The citation is as follows: ‘for their founda- on graph theory. In collaboration with inaugural prize was given to Jean-Pierre tional contributions to theoretical com- Erdős in the 1970s, Lovász developed Serre in 2003. Among the twenty-four puter science and discrete mathematics, complementary methods to Erdős’s exist- recipients, Karen Keskulla Uhlenbeck is and their leading role in shaping them in- ing probabilistic graph theory techni- the only woman laureate, who received to central fields of modern mathematics’. ques. Lovász’s research led to profound the honour unshared in 2019. Sathaman- Wigderson was born in Haifa, Israel, results in areas including combinatorial galam Ranga Iyengar Srinivasa Varadhan in 1956. He is the Herbert H. Maass Pro- optimization, algorithms, complexity, is the only recipient of Indian (and fessor in the School of Mathematics at graph theory and random walks. These Asian) origin to have won the prize (un- the Institute for Advanced Study (IAS) in areas span mathematics and theoretical shared in 2007)7. Six of the twenty-four Princeton, New Jersey, USA and leads computer science. One of his most fam- Abel Laureates are Fields medalists the IAS program in Computer Science ous works is the ‘LLL algorithm’ whose (Jean-Pierre Serre, Sir Michael Francis and Discrete Mathematics. Wigderson is name is derived from the names of the Atiyah, John Griggs Thompson, John recognized for his contributions to the three authors: Arjen K. Lenstra, Hendrik Willard Milnor, Pierre Deligne and Gri- major areas of computational complexity W. Lenstra and László Lovász4. This gory Aleksandrovich Margulis). The theory, including randomized computa- paper dealing with the factorization of deadline for nomination is 15 September tion, algorithms and optimization, circuit the polynomials with rational coeffi- each year (https://www.abelprize.no/). complexity, proof complexity, quantum cients has numerous applications. Lovász computation, cryptography and under- is a recipient of many awards including, standing of fundamental graph proper- Wolf Prize (1999), Knuth Prize (1999), 1. Reingold, O., Vadhan, S. and Wigderson, ties1. He has been able to address Gödel Prize (2001) and Kyoto Prize A., Ann. Math., 2002, 155(1), 157–187; questions concerning the power and limi- (2010). doi:10.2307/3062153. tations of algorithms. He also investi- Lovász has immense contributions to 2. Wigderson, A., Mathematics and Compu- tation: A Theory of Revolutionizing Tech- gated the applied aspects such as diverse areas of mathematics and com- nology and Science, Princeton University distributed computing in adversarial puter science. His contributions are part Press, USA, 2019; https://doi.org/10.2307/ environments, which is related to the and parcel of standard textbooks in both j.ctvckq7xb. 5 foundations of cryptography. The works the fields . He has also impacted the 3. Malhotra, R., Curr. Sci., 2010, 98(7), 887– of Wigderson have impacted diverse popularization of science and science 888. areas such as digital innovations in in- policy. In 2014, Lovász was elected 4. Lenstra, A. K., Lenstra Jr, H. W. and dustry, medicine, online communications President of the Hungarian Academy of Lovász, L., Math. Ann., 1982, 261(4), 515– and electronic commerce2. Wigderson is Sciences (HAS). In 2003, HAS in part- 534; doi:10.1007/BF01457454. a recipient of many awards including, nership with UNESCO and ICSU (Inter- 5. Bárány, I., Katona, G. O. and Sali, A. Nevanlinna Prize (1994), Gödel Prize national Council for Science), initiated a (eds), Building Bridges II: Mathematics of László Lovász, Springer Nature, 2020, vol. (2009) and Knuth Prize (2019). unique forum series on global science 28; http://dx.doi.org/10.1007/978-3-662- The inauguration of the International policies known as the World Science 59204-5. Centre for Theoretical Sciences, Benga- Forum (WSF, https://worldscienceforum. 6. Khan, S. A., Curr. Sci., 2020, 118(12), luru, India took place in December 2009. org/), organized biannually in Budapest, 1867; 2018, 114(2), 252; 2016, 110(1), 15. The inauguration was marked by the Hungary. Since 2013, it is being held at 7. Karandikar, R. L., Curr. Sci., 2007, 92(10), event ‘Science without Boundaries’, locations between Budapest and partner 1328–1330. where specialists discussed the place of countries (2013 in Brazil, 2017 in Jordan cross-fertilization in research and the and in 2021, it is scheduled to be held in Sameen Ahmed Khan, Dhofar Univer- significance of theoretical sciences. South Africa). Under the leadership of sity, Department of Mathematics and Wigderson gave a public lecture titled, Lovász, the WSF has transformed into a Sciences, College of Arts and Applied ‘The P versus NP problem: efficient gigantic event. Now, it attracts thousands Sciences, Salalah, Sultanate of Oman. computation and the limits of human of participants from over one hundred e-mail: rohelakhan@yahoo.com 16 CURRENT SCIENCE, VOL. 121, NO. 1, 10 JULY 2021 .
Load more

Recommended publications
  • Tarjan Transcript Final with Timestamps
    A.M. Turing Award Oral History Interview with Robert (Bob) Endre Tarjan by Roy Levin San Mateo, California July 12, 2017 Levin: My name is Roy Levin. Today is July 12th, 2017, and I’m in San Mateo, California at the home of Robert Tarjan, where I’ll be interviewing him for the ACM Turing Award Winners project. Good afternoon, Bob, and thanks for spending the time to talk to me today. Tarjan: You’re welcome. Levin: I’d like to start by talking about your early technical interests and where they came from. When do you first recall being interested in what we might call technical things? Tarjan: Well, the first thing I would say in that direction is my mom took me to the public library in Pomona, where I grew up, which opened up a huge world to me. I started reading science fiction books and stories. Originally, I wanted to be the first person on Mars, that was what I was thinking, and I got interested in astronomy, started reading a lot of science stuff. I got to junior high school and I had an amazing math teacher. His name was Mr. Wall. I had him two years, in the eighth and ninth grade. He was teaching the New Math to us before there was such a thing as “New Math.” He taught us Peano’s axioms and things like that. It was a wonderful thing for a kid like me who was really excited about science and mathematics and so on. The other thing that happened was I discovered Scientific American in the public library and started reading Martin Gardner’s columns on mathematical games and was completely fascinated.
    [Show full text]
  • Information and Announcements Mathematics Prizes Awarded At
    Information and Announcements Mathematics Prizes Awarded at ICM 2014 The International Congress of Mathematicians (ICM) is held once in four years under the auspices of the International Mathematical Union (IMU). The ICM is the largest, and the most prestigious, meeting of the mathematics community. During the ICM, the Fields Medal, the Nevanlinna Prize, the Gauss Prize, the Chern Medal and the Leelavati Prize are awarded. The Fields Medals are awarded to mathematicians under the age of 40 to recognize existing outstanding mathematical work and for the promise of future achievement. A maximum of four Fields Medals are awarded during an ICM. The Nevanlinna Prize is awarded for outstanding contributions to mathematical aspects of information sciences; this awardee is also under the age of 40. The Gauss Prize is given for mathematical research which has made a big impact outside mathematics – in industry or technology, etc. The Chern Medal is awarded to a person whose mathematical accomplishments deserve the highest level of recognition from the mathematical community. The Leelavati Prize is sponsored by Infosys and is a recognition of an individual’s extraordinary achievements in popularizing among the public at large, mathematics, as an intellectual pursuit which plays a crucial role in everyday life. The 27th ICM was held in Seoul, South Korea during August 13–21, 2014. Fields Medals The following four mathematicians were awarded the Fields Medal in 2014. 1. Artur Avila, “for his profound contributions to dynamical systems theory, which have changed the face of the field, using the powerful idea of renormalization as a unifying principle”. Work of Artur Avila (born 29th June 1979): Artur Avila’s outstanding work on dynamical systems, and analysis has made him a leader in the field.
    [Show full text]
  • “To Be a Good Mathematician, You Need Inner Voice” ”Огонёкъ” Met with Yakov Sinai, One of the World’S Most Renowned Mathematicians
    “To be a good mathematician, you need inner voice” ”ОгонёкЪ” met with Yakov Sinai, one of the world’s most renowned mathematicians. As the new year begins, Russia intensifies the preparations for the International Congress of Mathematicians (ICM 2022), the main mathematical event of the near future. 1966 was the last time we welcomed the crème de la crème of mathematics in Moscow. “Огонёк” met with Yakov Sinai, one of the world’s top mathematicians who spoke at ICM more than once, and found out what he thinks about order and chaos in the modern world.1 Committed to science. Yakov Sinai's close-up. One of the most eminent mathematicians of our time, Yakov Sinai has spent most of his life studying order and chaos, a research endeavor at the junction of probability theory, dynamical systems theory, and mathematical physics. Born into a family of Moscow scientists on September 21, 1935, Yakov Sinai graduated from the department of Mechanics and Mathematics (‘Mekhmat’) of Moscow State University in 1957. Andrey Kolmogorov’s most famous student, Sinai contributed to a wealth of mathematical discoveries that bear his and his teacher’s names, such as Kolmogorov-Sinai entropy, Sinai’s billiards, Sinai’s random walk, and more. From 1998 to 2002, he chaired the Fields Committee which awards one of the world’s most prestigious medals every four years. Yakov Sinai is a winner of nearly all coveted mathematical distinctions: the Abel Prize (an equivalent of the Nobel Prize for mathematicians), the Kolmogorov Medal, the Moscow Mathematical Society Award, the Boltzmann Medal, the Dirac Medal, the Dannie Heineman Prize, the Wolf Prize, the Jürgen Moser Prize, the Henri Poincaré Prize, and more.
    [Show full text]
  • A Decade of Lattice Cryptography
    Full text available at: http://dx.doi.org/10.1561/0400000074 A Decade of Lattice Cryptography Chris Peikert Computer Science and Engineering University of Michigan, United States Boston — Delft Full text available at: http://dx.doi.org/10.1561/0400000074 Foundations and Trends R in Theoretical Computer Science Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com sales@nowpublishers.com Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is C. Peikert. A Decade of Lattice Cryptography. Foundations and Trends R in Theoretical Computer Science, vol. 10, no. 4, pp. 283–424, 2014. R This Foundations and Trends issue was typeset in LATEX using a class file designed by Neal Parikh. Printed on acid-free paper. ISBN: 978-1-68083-113-9 c 2016 C. Peikert All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923. Authorization to photocopy items for in- ternal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC). The ‘services’ for users can be found on the internet at: www.copyright.com For those organizations that have been granted a photocopy license, a separate system of payment has been arranged.
    [Show full text]
  • The Best Nurturers in Computer Science Research
    The Best Nurturers in Computer Science Research Bharath Kumar M. Y. N. Srikant IISc-CSA-TR-2004-10 http://archive.csa.iisc.ernet.in/TR/2004/10/ Computer Science and Automation Indian Institute of Science, India October 2004 The Best Nurturers in Computer Science Research Bharath Kumar M.∗ Y. N. Srikant† Abstract The paper presents a heuristic for mining nurturers in temporally organized collaboration networks: people who facilitate the growth and success of the young ones. Specifically, this heuristic is applied to the computer science bibliographic data to find the best nurturers in computer science research. The measure of success is parameterized, and the paper demonstrates experiments and results with publication count and citations as success metrics. Rather than just the nurturer’s success, the heuristic captures the influence he has had in the indepen- dent success of the relatively young in the network. These results can hence be a useful resource to graduate students and post-doctoral can- didates. The heuristic is extended to accurately yield ranked nurturers inside a particular time period. Interestingly, there is a recognizable deviation between the rankings of the most successful researchers and the best nurturers, which although is obvious from a social perspective has not been statistically demonstrated. Keywords: Social Network Analysis, Bibliometrics, Temporal Data Mining. 1 Introduction Consider a student Arjun, who has finished his under-graduate degree in Computer Science, and is seeking a PhD degree followed by a successful career in Computer Science research. How does he choose his research advisor? He has the following options with him: 1. Look up the rankings of various universities [1], and apply to any “rea- sonably good” professor in any of the top universities.
    [Show full text]
  • Constraint Based Dimension Correlation and Distance
    Preface The papers in this volume were presented at the Fourteenth Annual IEEE Conference on Computational Complexity held from May 4-6, 1999 in Atlanta, Georgia, in conjunction with the Federated Computing Research Conference. This conference was sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, in cooperation with the ACM SIGACT (The special interest group on Algorithms and Complexity Theory) and EATCS (The European Association for Theoretical Computer Science). The call for papers sought original research papers in all areas of computational complexity. A total of 70 papers were submitted for consideration of which 28 papers were accepted for the conference and for inclusion in these proceedings. Six of these papers were accepted to a joint STOC/Complexity session. For these papers the full conference paper appears in the STOC proceedings and a one-page summary appears in these proceedings. The program committee invited two distinguished researchers in computational complexity - Avi Wigderson and Jin-Yi Cai - to present invited talks. These proceedings contain survey articles based on their talks. The program committee thanks Pradyut Shah and Marcus Schaefer for their organizational and computer help, Steve Tate and the SIGACT Electronic Publishing Board for the use and help of the electronic submissions server, Peter Shor and Mike Saks for the electronic conference meeting software and Danielle Martin of the IEEE for editing this volume. The committee would also like to thank the following people for their help in reviewing the papers: E. Allender, V. Arvind, M. Ajtai, A. Ambainis, G. Barequet, S. Baumer, A. Berthiaume, S.
    [Show full text]
  • Interactions of Computational Complexity Theory and Mathematics
    Interactions of Computational Complexity Theory and Mathematics Avi Wigderson October 22, 2017 Abstract [This paper is a (self contained) chapter in a new book on computational complexity theory, called Mathematics and Computation, whose draft is available at https://www.math.ias.edu/avi/book]. We survey some concrete interaction areas between computational complexity theory and different fields of mathematics. We hope to demonstrate here that hardly any area of modern mathematics is untouched by the computational connection (which in some cases is completely natural and in others may seem quite surprising). In my view, the breadth, depth, beauty and novelty of these connections is inspiring, and speaks to a great potential of future interactions (which indeed, are quickly expanding). We aim for variety. We give short, simple descriptions (without proofs or much technical detail) of ideas, motivations, results and connections; this will hopefully entice the reader to dig deeper. Each vignette focuses only on a single topic within a large mathematical filed. We cover the following: • Number Theory: Primality testing • Combinatorial Geometry: Point-line incidences • Operator Theory: The Kadison-Singer problem • Metric Geometry: Distortion of embeddings • Group Theory: Generation and random generation • Statistical Physics: Monte-Carlo Markov chains • Analysis and Probability: Noise stability • Lattice Theory: Short vectors • Invariant Theory: Actions on matrix tuples 1 1 introduction The Theory of Computation (ToC) lays out the mathematical foundations of computer science. I am often asked if ToC is a branch of Mathematics, or of Computer Science. The answer is easy: it is clearly both (and in fact, much more). Ever since Turing's 1936 definition of the Turing machine, we have had a formal mathematical model of computation that enables the rigorous mathematical study of computational tasks, algorithms to solve them, and the resources these require.
    [Show full text]
  • Optimal Hitting Sets for Combinatorial Shapes
    Optimal Hitting Sets for Combinatorial Shapes Aditya Bhaskara∗ Devendra Desai† Srikanth Srinivasan‡ November 5, 2018 Abstract We consider the problem of constructing explicit Hitting sets for Combinatorial Shapes, a class of statistical tests first studied by Gopalan, Meka, Reingold, and Zuckerman (STOC 2011). These generalize many well-studied classes of tests, including symmetric functions and combi- natorial rectangles. Generalizing results of Linial, Luby, Saks, and Zuckerman (Combinatorica 1997) and Rabani and Shpilka (SICOMP 2010), we construct hitting sets for Combinatorial Shapes of size polynomial in the alphabet, dimension, and the inverse of the error parame- ter. This is optimal up to polynomial factors. The best previous hitting sets came from the Pseudorandom Generator construction of Gopalan et al., and in particular had size that was quasipolynomial in the inverse of the error parameter. Our construction builds on natural variants of the constructions of Linial et al. and Rabani and Shpilka. In the process, we construct fractional perfect hash families and hitting sets for combinatorial rectangles with stronger guarantees. These might be of independent interest. 1 Introduction Randomness is a tool of great importance in Computer Science and combinatorics. The probabilistic method is highly effective both in the design of simple and efficient algorithms and in demonstrating the existence of combinatorial objects with interesting properties. But the use of randomness also comes with some disadvantages. In the setting of algorithms, introducing randomness adds to the number of resource requirements of the algorithm, since truly random bits are hard to come by. For combinatorial constructions, ‘explicit’ versions of these objects often turn out to have more structure, which yields advantages beyond the mere fact of their existence (e.g., we know of explicit arXiv:1211.3439v1 [cs.CC] 14 Nov 2012 error-correcting codes that can be efficiently encoded and decoded, but we don’t know if random codes can [5]).
    [Show full text]
  • Science Lives: Video Portraits of Great Mathematicians
    Science Lives: Video Portraits of Great Mathematicians accompanied by narrative profiles written by noted In mathematics, beauty is a very impor- mathematics biographers. tant ingredient… The aim of a math- Hugo Rossi, director of the Science Lives project, ematician is to encapsulate as much as said that the first criterion for choosing a person you possibly can in small packages—a to profile is the significance of his or her contribu- high density of truth per unit word. tions in “creating new pathways in mathematics, And beauty is a criterion. If you’ve got a theoretical physics, and computer science.” A beautiful result, it means you’ve got an secondary criterion is an engaging personality. awful lot identified in a small compass. With two exceptions (Atiyah and Isadore Singer), the Science Lives videos are not interviews; rather, —Michael Atiyah they are conversations between the subject of the video and a “listener”, typically a close friend or colleague who is knowledgeable about the sub- Hearing Michael Atiyah discuss the role of beauty ject’s impact in mathematics. The listener works in mathematics is akin to reading Euclid in the together with Rossi and the person being profiled original: You are going straight to the source. The to develop a list of topics and a suggested order in quotation above is taken from a video of Atiyah which they might be discussed. “But, as is the case made available on the Web through the Science with all conversations, there usually is a significant Lives project of the Simons Foundation. Science amount of wandering in and out of interconnected Lives aims to build an archive of information topics, which is desirable,” said Rossi.
    [Show full text]
  • Public Recognition and Media Coverage of Mathematical Achievements
    Journal of Humanistic Mathematics Volume 9 | Issue 2 July 2019 Public Recognition and Media Coverage of Mathematical Achievements Juan Matías Sepulcre University of Alicante Follow this and additional works at: https://scholarship.claremont.edu/jhm Part of the Arts and Humanities Commons, and the Mathematics Commons Recommended Citation Sepulcre, J. "Public Recognition and Media Coverage of Mathematical Achievements," Journal of Humanistic Mathematics, Volume 9 Issue 2 (July 2019), pages 93-129. DOI: 10.5642/ jhummath.201902.08 . Available at: https://scholarship.claremont.edu/jhm/vol9/iss2/8 ©2019 by the authors. This work is licensed under a Creative Commons License. JHM is an open access bi-annual journal sponsored by the Claremont Center for the Mathematical Sciences and published by the Claremont Colleges Library | ISSN 2159-8118 | http://scholarship.claremont.edu/jhm/ The editorial staff of JHM works hard to make sure the scholarship disseminated in JHM is accurate and upholds professional ethical guidelines. However the views and opinions expressed in each published manuscript belong exclusively to the individual contributor(s). The publisher and the editors do not endorse or accept responsibility for them. See https://scholarship.claremont.edu/jhm/policies.html for more information. Public Recognition and Media Coverage of Mathematical Achievements Juan Matías Sepulcre Department of Mathematics, University of Alicante, Alicante, SPAIN JM.Sepulcre@ua.es Synopsis This report aims to convince readers that there are clear indications that society is increasingly taking a greater interest in science and particularly in mathemat- ics, and thus society in general has come to recognise, through different awards, privileges, and distinctions, the work of many mathematicians.
    [Show full text]
  • Operator Scaling Via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing∗
    Operator Scaling via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing∗ Zeyuan Allen-Zhu Ankit Garg Yuanzhi Li Microsoft Research AI Microsoft Research New England Princeton University zeyuan@csail.mit.edu garga@microsoft.com yuanzhil@cs.princeton.edu Rafael Oliveira Avi Wigderson University of Toronto Institute for Advanced Study rafael@cs.toronto.edu avi@math.ias.edu ABSTRACT 1 INTRODUCTION We propose a new second-order method for geodesically convex Group orbits and their closures capture natural notions of equiv- optimization on the natural hyperbolic metric over positive definite alence and are studied in several fields of mathematics like group matrices. We apply it to solve the operator scaling problem in time theory, invariant theory and algebraic geometry. They also come polynomial in the input size and logarithmic in the error. This up naturally in theoretical computer science. For example, graph is an exponential improvement over previous algorithms which isomorphism, the VP vs VNP question and lower bounds on were analyzed in the usual Euclidean, “commutative” metric (for tensor rank are all questions about such notions of equivalence. which the above problem is not convex). Our method is general In this paper, we focus on the orbit-closure intersection problem, and applicable to other settings. which is the most natural way to define equivalence for continuous As a consequence, we solve the equivalence problem for the left- group actions. We explore a general approach to the problem via right group action underlying the operator scaling problem. This geodesically convex optimization. As a testbed for our techniques, yields a deterministic polynomial-time algorithm for a new class of we design a deterministic polynomial-time algorithm for the orbit- Polynomial Identity Testing (PIT) problems, which was the original closure intersection problem for the left-right group action.
    [Show full text]
  • László Lovász Avi Wigderson of Eötvös Loránd University of the Institute for Advanced Study, in Budapest, Hungary and Princeton, USA
    2021 The Norwegian Academy of Science and Letters has decided to award the Abel Prize for 2021 to László Lovász Avi Wigderson of Eötvös Loránd University of the Institute for Advanced Study, in Budapest, Hungary and Princeton, USA, “for their foundational contributions to theoretical computer science and discrete mathematics, and their leading role in shaping them into central fields of modern mathematics.” Theoretical Computer Science (TCS) is the study of computational lens”. Discrete structures such as the power and limitations of computing. Its roots go graphs, strings, permutations are central to TCS, back to the foundational works of Kurt Gödel, Alonzo and naturally discrete mathematics and TCS Church, Alan Turing, and John von Neumann, leading have been closely allied fields. While both these to the development of real physical computers. fields have benefited immensely from more TCS contains two complementary sub-disciplines: traditional areas of mathematics, there has been algorithm design which develops efficient methods growing influence in the reverse direction as well. for a multitude of computational problems; and Applications, concepts, and techniques from TCS computational complexity, which shows inherent have motivated new challenges, opened new limitations on the efficiency of algorithms. The notion directions of research, and solved important open of polynomial-time algorithms put forward in the problems in pure and applied mathematics. 1960s by Alan Cobham, Jack Edmonds, and others, and the famous P≠NP conjecture of Stephen Cook, László Lovász and Avi Wigderson have been leading Leonid Levin, and Richard Karp had strong impact on forces in these developments over the last decades. the field and on the work of Lovász and Wigderson.
    [Show full text]