Boolean Functions with small Spectral Norm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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.

متن کامل

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...

متن کامل

Spectral Analysis of Boolean Functions under Non-uniformity of Arguments

For some classes of Boolean functions we study charecteristics

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Geometric and Functional Analysis

سال: 2008

ISSN: 1016-443X,1420-8970

DOI: 10.1007/s00039-008-0654-y