Lecture slides

The slides from the lectures are published here:

• Lecture1Handout.pdf Ladda ner Lecture1Handout.pdf
  Introduction, Time Complexity, Graphs (Chapter 1-3).
• Lecture2Handout.pdf Ladda ner Lecture2Handout.pdf
  Greedy Algorithms (Ch 4).
• Lecture3Handout.pdf Ladda ner Lecture3Handout.pdf
  Divide & Conquer (Ch 5).
• Lecture4Handout.pdf Ladda ner Lecture4Handout.pdf
  Dynamic Programming 1 (Ch 6).
• Lecture5Handout.pdf Ladda ner Lecture5Handout.pdf
  Dynamic Programming 2 (Ch 6). (Updated Jan 28 with minor bugfixes.)
• Lecture6Handout.pdf Ladda ner Lecture6Handout.pdf
  Network Flow (Ch 7). (Updated Feb 3 with a bugfix to figure on "Example Continued" slide.)
• Lecture7Handout.pdf Ladda ner Lecture7Handout.pdf
  Applications of Network Flow (Ch 7).
• Lecture8Handout.pdf Ladda ner Lecture8Handout.pdf
  Reductions and Complexity Classes (Ch 8).
• Lecture9Handout.pdf Ladda ner Lecture9Handout.pdf
   NP-completeness (Ch 8).
• Lecture10Handout.pdf Ladda ner Lecture10Handout.pdf
   Turing Machines and Decidability
• Lecture11Handout.pdf Ladda ner Lecture11Handout.pdf
  The Cook-Levin Theorem and More Complexity Classes (Ch 9)
  
  

• Lecture12Handout.pdf Ladda ner Lecture12Handout.pdf
  . Repetition of Lectures 8-11.
  April 1st, 10.00-12.00. Zoom Meeting ID: 224 598 369 Links to an external site.
  
  

  Part 1	Part 2

  
  
  
• Lecture13Handout.pdf Ladda ner Lecture13Handout.pdf
  . Approximation Algorithms (Ch 11)
  April 8th, 08.00-10.00. Zoom Meeting ID: 870 645 453 Links to an external site. 
  

  Part 1 of 3	Part 2 of 3	Part 3 of 3

  Thanks to Mohammad Javad Ahmadi Amin for providing the raw recording (which I have then edited) for Part 2, where my computer kept crashing!
  
  
  
• Lecture14Handout.pdf Ladda ner Lecture14Handout.pdf
  . Randomized Algorithms (Ch 13).
  April 20, 15.00-17.00.  Zoom Meeting ID: 630 7056 6928 Links to an external site.
  
  

  Part 1 of 2	Part 2 of 2

  
  
  

Notes from the lectures from the previous year can be found here (link to the Canvas for algokomp19).  Note that the order of the topics last year was a bit different than this year, see the detailed schedule for last year for the mapping of topics to lecture numbers