Boolean functions with small spectral norm, revisited
نویسندگان
چکیده
منابع مشابه
Spectral Norm of Symmetric Functions
The spectral norm of a Boolean function f : {0, 1} → {−1, 1} is the sum of the absolute values of its Fourier coefficients. This quantity provides useful upper and lower bounds on the complexity of a function in areas such as learning theory, circuit complexity, and communication complexity. In this paper, we give a combinatorial characterization for the spectral norm of symmetric functions. We...
متن کاملFast Boolean Matching for Small Practical Functions
This paper proposes a fast algorithm for Boolean matching of completely specified Boolean functions. The algorithm can be applied on-the-fly to millions of small practical functions appearing in industrial designs, leading to runtime and memory reduction in logic synthesis and technology mapping. The algorithm is conceptually simpler, faster, and more scalable than previous work.
متن کاملAlmost Boolean Functions: The Design of Boolean Functions by Spectral Inversion
The design of Boolean functions with properties of cryptographic significance is a hard task. In this paper, we adopt an unorthodox approach to the design of such functions. Our search space is the set of functions that possess the required properties. It is ‘Booleanness’ that is evolved.
متن کاملSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملQuantum Query Complexity of Boolean Functions with Small On-Sets
The main objective of this paper is to show that the quantum query complexity Q(f) of an N -bit Boolean function f is bounded by a function of a simple and natural parameter, i.e., M = |{x | f(x) = 1}| or the size of f ’s on-set. We prove that: (i) For poly(N) ≤ M ≤ 2Nd for some constant 0 < d < 1, the upper bound of Q(f) is O( √ N logM/ logN). This bound is tight, namely there is a Boolean fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Proceedings of the Cambridge Philosophical Society
سال: 2018
ISSN: 0305-0041,1469-8064
DOI: 10.1017/s030500411800035x