Supported by an NSERC PGS B and a Killam Predoctoral Fellowship.
The Boolean functions computed by random Boolean formulas or how to grow the right function†
Article first published online: 6 OCT 2005
Copyright © 2005 Wiley Periodicals, Inc.
Random Structures & Algorithms
Volume 27, Issue 4, pages 490–519, December 2005
How to Cite
Brodsky, A. and Pippenger, N. (2005), The Boolean functions computed by random Boolean formulas or how to grow the right function. Random Struct. Alg., 27: 490–519. doi: 10.1002/rsa.20095
The research reported here was done while the authors were in the Department of Computer Science, University of British Columbia, Vancouver, BC, Canada.
- Issue published online: 24 OCT 2005
- Article first published online: 6 OCT 2005
- Manuscript Accepted: 24 NOV 2004
- Manuscript Revised: 5 MAR 2004
- Manuscript Received: 25 FEB 2003
This article has been cited by:
- 2Parallel complexity of random Boolean circuits, Journal of Statistical Mechanics: Theory and Experiment, 2011, 2011, 04, P04015, , , ,
- 3Noisy random Boolean formulae: A statistical physics perspective, Physical Review E, 2010, 82, 4, , ,
- 4On the robustness of random Boolean formulae, Journal of Physics: Conference Series, 2010, 233, 012015, , ,
- 5Computing with Noise: Phase Transitions in Boolean Formulas, Physical Review Letters, 2009, 103, 24, , ,