Average-case complexity of elementary Boolean functions

被引:0
|
作者
Chashkin, A.V.
机构
来源
Discrete Mathematics and Applications | 2001年 / 11卷 / 01期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
The disjunction, conjunction, and linear function, each depending on an increasing number of arguments, are computed by straight-line programs with a conditional stop. Asymptotically exact formulas for the average-case complexity of these functions are found. It is shown that the average-case complexities of disjunction and conjunction are constants and the average-case complexity of the linear function coincides with its circuit size. © VSP 2001.
引用
收藏
页码:71 / 81
相关论文
共 50 条