Question 5 for the exam had a small error. It asked about undecidability but should instead be:
What is characteristic for the problems we show to be NP-complete?
Has been corrected.
You can start with this first half, the other will follow shortly.
Due to a sudden family incidence, I will not be in Oslo on Friday.
The exercises will there be moved online. I will be available on the zoom link.
Institutt for informatikk