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

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!