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

Celý popis

Podrobná bibliografia

Vydané v:	Random structures & algorithms Ročník 27; číslo 4; s. 490 - 519
Hlavní autori:	Brodsky, Alex, Pippenger, Nicholas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.12.2005
Predmet:	computational and structural complexity growth processes probabilistic amplification random Boolean functions
ISSN:	1042-9832, 1098-2418
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!