The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function
<|reference_start|>The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function: Among their many uses, growth processes (probabilistic amplification), 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 (1984) hold. First, we completely characterize growth processes that use linear connectives. Second, by extending Savick\'y's (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. Additionally, we obtain explicit bounds on the convergence rates of several growth processes, including the growth process studied by Savick\'y (1990).<|reference_end|>
@article{brodsky2003the,
    title={The Boolean Functions Computed by Random Boolean Formulas OR How to Grow
  the Right Function},
    author={Alex Brodsky and Nicholas Pippenger},
    journal={arXiv preprint arXiv:cs/0302028},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0302028},
    primaryClass={cs.DM cs.CC}
}