The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound

翻译：当 n 趋于无穷大时，n 元二元弯曲函数数量的对数渐近小于 $11(2^n)/32$。 关键词：布尔函数，沃尔什-哈达玛变换，平台函数，弯曲函数，上界