The Boolean functions computed by random Boolean formulas or how to grow the right function

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

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 27; no. 4; pp. 490 - 519
Main Authors:	Brodsky, Alex, Pippenger, Nicholas
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.12.2005
Subjects:	computational and structural complexity growth processes probabilistic amplification random Boolean functions
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!