Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

Garey-Johnson Cartoon Updated

The Famous Cartoon

The 1979 textbook by Michael Garey and David S. Johnson “Computers and Intractability: A Guide to the Theory of NP-Completeness” has been very influential and is one of the most cited books in computer science.

The book famously features a cartoon which depicts a researcher who reports to his boss and justifies why he didn’t succeed in carrying out a given task. With that scenario the cartoon illustrates how the method of NP-completeness can be used to resolve a famous predicament of computer science where for literally thousands of fundamental computational problems one can neither give an efficient algorithm, nor prove that such an algorithms doesn’t exist.

 

The Update

Here is a new and more contemporary version of the cartoon. Do you spot the difference?

Starting  with the current  2018 summer term, the new cartoon will be used  on lecture slides for the first-year algorithms course  at TU Wien.

The cartoon has been released by Stefan Szeider under the Creative Commons licence 4.0.

 

 

 

 

 

 

 

 

 

 

 

 

News

  • New FWF ESPRIT Postdocs

    New FWF ESPRIT Postdocs

    2022-11-09
    Leroy Chew and Alexis de Colnet just joined the Algorithms and Complexity group as PIs of their own FWF ESPRIT …Read More »
  • Best student paper award at DIAGRAMS 2022

    Best student paper award at DIAGRAMS 2022

    2022-10-01
    Alexander Dobler received the Best Student Paper Award at the 13th International Conference on the Theory and Application of Diagrams …Read More »
  • Robert Ganian promoted to Associate Professor

    Robert Ganian promoted to Associate Professor

    2022-07-01
    Effective as of today, Robert Ganian is promoted to a tenured Associate Professor at the Algorithms and Complexity group. Congratulations, …Read More »
  • Best paper award at EvoCOP 2022

    Best paper award at EvoCOP 2022

    2022-05-24
    Jonas Mayerhofer, Markus Kirchweger, Marc Huber, and Günther Raidl received the best paper award for their work A Beam Search …Read More »
  • New PhD: Guangping Li

    New PhD: Guangping Li

    2022-05-13
    Guangping Li successfully defended her PhD thesis “An Algorithmic Study of Practical Map Labeling” on May 13, 2022. Congratulations, Dr. …Read More »

News archive

All news for 2015, 2016, 2017, 2018, 2019, 2020, 2021 and 2022.
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.