首页 | 本学科首页   官方微博 | 高级检索  
     


The Boolean functions computed by random Boolean formulas or how to grow the right function
Authors:Alex Brodsky  Nicholas Pippenger
Abstract:We characterize growth processes (probabilistic amplification) by their initial conditions to derive conditions under which results such as Valiant's 24 hold. We completely characterize growth processes that use linear connectives and generalize Savický's 19 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
Keywords:computational and structural complexity  growth processes  probabilistic amplification  random Boolean functions
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号