A problem re the k-Consistency Algorithm for CSPs || @ CMU || Recitation 11 of CS Theory Toolkit

Описание: In this recitation/OH, we talk about one problem on Homework #10, concerning the "k-consistency algorithm" for CSPs, and how it (supposedly) works correctly and efficiently on any instance whose primal has treewidth at most k. Recitation 11 of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.

Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)

Thumbnail photo by Rebecca Kiger (https://www.rebeccakphoto.com/)