Technical Reports

The ICICS/CS Reading Room


UBC CS TR-2003-02 Summary

The Boolean Functions Computed by Random Boolean Formulas OR, January 30, 2003 Alex Brodsky and Nicholas Pippenger

How to Grow the Right Function probabilistic amplification, random Boolean functions were used for constructing reliable networks from unreliable components, and deriving complexity bounds of various classes of functions. Hence, determining the initial conditions for such processes is an important and challenging problem. In this paper we characterize growth processes by their initial conditions and derive conditions under which results such as Valiant's (Valiant, 1984) hold. First, we completely characterize growth processes that use linear connectives. Second, by extending Savick\'y's (Savick\'y, 1990) analysis, via ``Restriction Lemmas'', we characterize growth processes that use monotone connectives, and show that our technique is applicable to growth processes that use other connectives as well.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.