Satisfiability Problem · Problem Statement
Lesson 9
Problem. How many satisfying assignments does the following formula have? \[(x_{1} \lor x_{2} \lor \dotsb \lor x_{n}) \land \bigwedge_{1 \le i < j \le n}(\overline{x_i}\lor \overline{x_j})\]
5 points