You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1 lines
151 B
1 lines
151 B
Given a propositional formula $\varphi$, the Boolean Satisfiability Problem asks whether there exists a model such that the formula evaluates to true.
|