Local properties of Boolean functions II: isotony
نویسندگان
چکیده
منابع مشابه
Testing Properties of Boolean Functions
Given oracle access to some boolean function f, how many queries do we need to test whether f is linear? Or monotone? Or whether its output is completely determined by a small number of the input variables? This thesis studies these and related questions in the framework of property testing introduced by Rubinfeld and Sudan (’96). The results of this thesis are grouped into three main lines of ...
متن کاملLocal Maxima of Quadratic Boolean Functions
Combinatorics, Probability and Computing / Volume 25 / Issue 04 / July 2016, pp 633 640 DOI: 10.1017/S0963548315000322, Published online: 21 December 2015 Link to this article: http://journals.cambridge.org/abstract_S0963548315000322 How to cite this article: HUNTER SPINK (2016). Local Maxima of Quadratic Boolean Functions. Combinatorics, Probability and Computing, 25, pp 633-640 doi:10.1017/S0...
متن کاملApproximation Properties of Positive Boolean Functions
The universal approximation property is an important characteristic of models employed in the solution of machine learning problems. The possibility of approximating within a desired precision any Borel measurable function guarantees the generality of the considered approach. The properties of the class of positive Boolean functions, realizable by digital circuits containing only and and or por...
متن کاملOn Some Iteration Properties of Boolean Functions
This paper introduces and describes an iterative model for the study of some properties of Boolean functions. Several kinds of iterative functions are studied: they are obtained by substituting some of the independent variables x, off (x) by the function f itself. Algebraic formulas relating classical representation modes of Boolean functions to the iterative forms are introduced. Several possi...
متن کاملOn Cryptographic Properties of Random Boolean Functions
Boolean functions used in cryptographic applications have to satisfy various cryptographic criteria. Although the choice of the criteria depends on the cryptosystem in which they are used, there are some properties (balancedness, nonlinearity, high algebraic degree, correlation immunity, propagation criteria) which a cryptographically strong Boolean function ought to have. We study the above me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1975
ISSN: 0012-365X
DOI: 10.1016/0012-365x(75)90016-3