浏览全部资源
扫码关注微信
1. 西安电子科技大学 综合业务网理论及关键技术国家重点实验室,陕西,西安,710071
2. 兰州大学 数学与统计学院,甘肃,兰州,730000
3. 西安电子科技大学 综合业务网理论及关键技术国家重点实验室陕西西安,710071
4. 兰州大学 数学与统计学院甘肃兰州,730000
Published:2009
移动端阅览
ZHOU Yu, WANG Xiao-fen, LUO Yan-feng, et al. Algebraic Thickness of Boolean Functions[J]. Acta Electronica Sinica, 2009, 37(7): 1412-1415.
DOI:
ZHOU Yu, WANG Xiao-fen, LUO Yan-feng, et al. Algebraic Thickness of Boolean Functions[J]. Acta Electronica Sinica, 2009, 37(7): 1412-1415. DOI:
基于布尔函数的代数次数和代数厚度
给出了布尔函数和其分解函数的代数厚度的关系
利用递归和反证法导出了
n元布尔函数代数厚度的上界是2* *(n-1)
这个上界回答了"是否存在代数厚度大于2* *(n-1)的n元布尔函数"这个公开问题.在此基础上改进了n元k(2≤k≤(n-1)/2)
次基本对称布尔函数的代数厚度的上界
同时也得到了布尔函数的代数厚度的一些性质.
Based on the algebraic degree and the algebraic thickness of Boolean functions
the relationship of algebraic thickness between a Boolean function and their decomposing Boolean functions is given
and the upper bound on the algebraic thickness of Boolean functions with
n
variables is 2* *(
-1) by the recurrence method and the reduction to absurdity.The upper bound answers the open problem:"whether there exists a Boolean function with
variables whose algebraic thickness is strictly greater than 2* *(
-1)".At the end of this paper
according to this fact an upper bound on algebraic thickness of elementary symmetric Boolean functions of
variables with algebraic degree
k
(2≤
≤(
-1)/2) is improved
and some properties on algebraic thickness of Boolean functions are derived.
0
Views
890
下载量
2
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution