Open Problems in Analysis of Boolean Functions
نویسنده
چکیده
A list of open problems in the field of analysis of boolean functions, compiled February 2012 for the Simons Symposium.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملA construction of binary linear codes from Boolean functions
Boolean functions have important applications in cryptography and coding theory. Two famous classes of binary codes derived from Boolean functions are the Reed-Muller codes and Kerdock codes. In the past two decades, a lot of progress on the study of applications of Boolean functions in coding theory has been made. Two generic constructions of binary linear codes with Boolean functions have bee...
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras II. Regularity
This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...
متن کاملTheoretische Informatik , Universität Ulm
With the rapid advances in computers, it becomes attractive to explore the use of computers to attack open problems in computational complexity. In this article, we concentrate on the problems of the complexity of Boolean functions, and overview several recent attempts to use computers in various ways to obtain concrete results on major problems in computational complexity. We discuss the probl...
متن کاملFourier Analysis of Boolean functions and Discrete Isoperimetry
In this talk I will describe recent results and open problems concerning Fourier analysis of boolean functions and applications to combinatorics, probability and theoretical computer science. Of particular interest is the relation with discrete isoperimetric inequalities. I will present a result with Friedgut and Naor on the ”stability” of the edge-isoperimetric inequality (total influence) and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1204.6447 شماره
صفحات -
تاریخ انتشار 2012