Satisfiability Problem · Problem Statement
Lesson 7
Problem. Consider a CNF formula consisting of a single disjunct of \(n\) variables: \((x_{1} \lor x_{2} \lor \dotsb \lor x_{n})\). How many satisfying assignments does it have?
5 points
Satisfiability Problem · Problem Statement
Problem. Consider a CNF formula consisting of a single disjunct of \(n\) variables: \((x_{1} \lor x_{2} \lor \dotsb \lor x_{n})\). How many satisfying assignments does it have?