Bent functions and random boolean formulas
Discrete Mathematics
Amplification by Read-Once Formulas
SIAM Journal on Computing
Some typical properties of large AND/OR Boolean formulas
Random Structures & Algorithms
Improved Boolean formulas for the Ramsey graphs
Random Structures & Algorithms
Complexity and Probability of Some Boolean Formulas
Combinatorics, Probability and Computing
Complexity and Limiting Ratio of Boolean Functions over Implication
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The fraction of large random trees representing a given Boolean function in implicational logic
Random Structures & Algorithms
| Hi-index | 0.00 |
We characterize growth processes (probabilistic amplification) by their initial conditions to derive conditions under which results such as Valiant's [J Algorithms 5 (1984), 363–366] hold. We completely characterize growth processes that use linear connectives and generalize Savický's [Discrete Math 147 (1990), 95–103] analysis to characterize growth processes that use monotone connectives. Additionally, we obtain explicit bounds on the convergence rates of several growth processes, including the growth process studied in Savický. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005The research reported here was done while the authors were in the Department of Computer Science, University of British Columbia, Vancouver, BC, Canada.Supported by an NSERC PGS B and a Killam Predoctoral Fellowship.Supported by an NSERC Discovery Grant and a Canada Research Chair.