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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Random structures & algorithms Jg. 27; H. 4; S. 490 - 519
Hauptverfasser: Brodsky, Alex, Pippenger, Nicholas
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.12.2005
Schlagworte:
computational and structural complexity
growth processes
probabilistic amplification
random Boolean functions
ISSN:1042-9832, 1098-2418
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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., 2005
Bibliographie:istex:CA454F0A0023E7F28114E91100D2A7E96E7304A4
The research reported here was done while the authors were in the Department of Computer Science, University of British Columbia, Vancouver, BC, Canada.
ArticleID:RSA20095
ark:/67375/WNG-ZMC3R5X6-9
Supported by an NSERC PGS B and a Killam Predoctoral Fellowship.
Supported by an NSERC Discovery Grant and a Canada Research Chair.
ISSN:1042-9832
1098-2418
DOI:10.1002/rsa.20095