Independent set
Kent Quanrud · 49:59
Independent set on a general undirected graph is NP-hard: a 3-SAT formula with *M* clauses is satisfiable if and only if a constructed graph has an independent set of size *M*. The same problem becomes polynomial-time...