\documentclass[11pt]{article}
\usepackage{handout2e}
\begin{document}
\input{macros}
\input{courseMacros}
\thispagestyle{empty}
\setlength{\parindent}{0pt}
\setlength{\parskip}{1.8ex}

\head{CS7800}{Advanced Algorithms}{Fall 2014}{5 November 2014}{16}

\begin{center}
\Large{\bf Problems of the Week -- 12 and 13}
\end{center}

{\bf 12. Integer linear programming and duality}

Problem 29-3 of text 

{\bf 13. Efficiently solvable 3-SAT instances}

Consider the class of 3-SAT instances in which each of the $n$
variables occurs in exactly 3 clauses (counting both positive and
negated occurrences).  Show that such 3-SAT instances are always
satisfiable and a satisfying assignment can be solved in polynomial
time.

\end{document}