Documents pnp_notes

CS 3719 (Theory of Computation and Algorithms) – Lectures 23-32 Antonina Kolokolova∗ March 2011 1 Scaling down to complexity In real life, we are interested whether a…

Documents Upper bounds on k -SAT

Upper bounds on k-SAT Chris Calabro [email protected] What is k-SAT? Variables – x1, x2, x3, … Literals – x1, ¬x1, x2, ¬x2,… Clauses – (x1 or ¬x2 or x3),…