A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On Converting CNF to DNF
[chapter]
2003
Lecture Notes in Computer Science
We study how big the blow-up in size can be when one switches between the CNF and DNF representations of Boolean functions. For a function f : {0, 1} n → {0, 1}, cnfsize(f ) denotes the minimum number of clauses in a CNF for f; similarly, dnfsize(f ) denotes the minimum number of terms in a DNF for f. For 0 m 2 n−1 , let dnfsize(m, n) be the maximum dnfsize(f ) for a function f : {0, 1} n → {0, 1} with cnfsize(f ) m. We show that there are constants c 1 , c 2 1 and > 0, such that for all large
doi:10.1007/978-3-540-45138-9_55
fatcat:6zcxfdpl4nedhjsmgj3mgfu524