Ω(n log n) Lower Bounds on Length of Boolean Formulas
Name
MIT-LCS-TM-187.pdf
Size
4.25 MB
Format
Adobe PDF
Checksum (MD5)
c8f8ea6266eb850fd9248f804893527c
Author(s)
Fischer, Michael J.
Meyer, Albert R.
Paterson, Michael S.
Date Issued
November 1980
Series/Report no.
MIT-LCS-TM-187
Abstract
A property of Boolean functions of n variables is described and shown to imply lower bounds as large as Ω(n log n) on the number of literals in any Boolean formula for any function with the property. Formulas over the full basis of binary operations (∧, ⊕, etc.) are considered. The lower bounds apply to all but the vanishing fraction of symmetric functions, in particular to all threshold functions with sufficiently large threshold and to the "congruent to zero modulo k" function for k>2. In the case k = 4 the bound is optimal.
Persistent DSpace Link
