3-Colorability

preview_player
Показать описание
Textbooks:
Computational Complexity: A Modern Approach by S. Arora and B. Barak.
Algorithm Design by J. Kleinberg and E. Tardos.

Lecture slides by K. Wayne accompanying the latter textbook:
Рекомендации по теме
Комментарии
Автор

Really helpful video! Just one question, Since the problem is given an arbitrary Graph how do we know its CNF formula? Usually, a graph is a set of nodes so would we need to explicitly say that Graph G is a representation of a formula?

simonaz
Автор

Why can't x1 and ~x2 both be green? Or red?

its_just_brian