Unsatisfiable (k,(4*2^k/k))-CNF formulas
| dc.creator | Gebauer, Heidi | |
| dc.date | 2008-10-10 | |
| dc.date.accessioned | 2026-07-07T10:09:11Z | |
| dc.date.available | 2026-07-07T10:09:11Z | |
| dc.description | 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. | |
| dc.description | 3 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/0810.1904 | |
| dc.identifier | http://arxiv.org/abs/0810.1904 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/171242 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Computer Science and Game Theory | |
| dc.subject | G.2.1 | |
| dc.title | Unsatisfiable (k,(4*2^k/k))-CNF formulas | |
| dc.type | text |