The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function

Details The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function

2003-02-19

arxiv.org/abs/cs/0302028v1

Computer Science

Discrete Mathematics

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-723866