Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with conjunctive-normal-form
Search options answers only
not deleted
user 390101
A formula is in conjunctive normal form (CNF) if it is a conjunction of clauses, where a clause is a disjunction of literals.
4
votes
Accepted
Prove that every to $\varphi_n$ equivalent formula in DNF has at least $2^n$ conjunctive cla...
Your approach is a valid approach, but I don't see how one could finish that argument. So instead, I'll give you my idea.
Let's look at one (satisfiable) clause $c_k$ from the minimal DNF. How many t …
- 804