Browsing LCS Technical Memos (1974 - 2003) by Title
Now showing items 492-492 of 492
-
Ω(n log n) Lower Bounds on Length of Boolean Formulas
(1980-11)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 ...