Hardest problems in NP are NP-complete

Previous slide Next slide Back to first slide View graphic version