Name
Abstract | ||
|---|---|---|
A boolean formula in a conjuctive normal form is called a (k,s)-formula if
every clause contains exactly k variables and every variable occurs in at most
s clauses. We prove the existence of a (k, 4 * (2^k/k))-CNF formula which is
unsatisfiable. |
Year | Venue | Keywords |
|---|---|---|
2008 | Clinical Orthopaedics and Related Research | discrete mathematics,game theory,normal form |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,True quantified Boolean formula,Mathematics | Journal | abs/0810.1 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heidi Gebauer | 1 | 83 | 11.07 |