Results 1 to 10 of about 262,112 (142)
The Stochastic Boolean Function Evaluation problem for symmetric Boolean functions [PDF]
Discrete Applied Mathematics, 2022 Preliminary versions of these results appeared on Arxiv in arXiv:1806.10660. That paper contains results for both arbitrary costs and unit costs. This paper considers only arbitrary costs.
Dimitrios Gkenosis +3 more
openaire +4 more sources
Testing Boolean Functions Properties [PDF]
Fundamenta Informaticae, 2021 The goal in the area of functions property testing is to determine whether a given black-box Boolean function has a particular given property or is ɛ-far from having that property. We investigate here several types of properties testing for Boolean functions (identity, correlations and balancedness) using the Deutsch-Jozsa algorithm (for the Deutsch ...
Zhengwei, Xie +4 more
openaire +3 more sources
Quantum algorithms for testing and learning Boolean functions [PDF]
, 2013 We discuss quantum algorithms based on the Bernstein-Vazirani algorithm for finding which input variables a Boolean function depends on. There are 2(n) possible linear Boolean functions of n input variables; given a linear Boolean function, the Bernstein-
Andersson, Anna Erika Elisabeth +2 more
core +1 more source
IEEE Transactions on Information Theory, 2005 We present an extensive study of symmetric Boolean functions, especially of their cryptographic properties. Our main result establishes the link between the periodicity of the simplified value vector of a symmetric Boolean function and its degree.
Canteaut, Anne, Videau, Marion
openaire +3 more sources
Advances in Mathematics of Communications, 2019 19 ...
Riera, Constanza, Stănică, Pantelimon
openaire +4 more sources
Width Hierarchy for k-OBDD of Small Width [PDF]
, 2015 In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function's non representation as k ...
Khadiev, Kamil
core +2 more sources
Overlap Algebras: a Constructive Look at Complete Boolean Algebras [PDF]
, 2020 The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set.
Ciraulo, Francesco, Contente, Michele
core +2 more sources
Self-Predicting Boolean Functions [PDF]
SIAM Journal on Discrete Mathematics, 2018 A Boolean function $g$ is said to be an optimal predictor for another Boolean function $f$, if it minimizes the probability that $f(X^{n})\neq g(Y^{n})$ among all functions, where $X^{n}$ is uniform over the Hamming cube and $Y^{n}$ is obtained from $X^{n}$ by independently flipping each coordinate with probability $ $.
Weinberger, Nir, Shayevitz, Ofer
openaire +3 more sources
A recursive paradigm to solve Boolean relations [PDF]
, 2008 A Boolean relation can specify some types of flexibility of a combinational circuit that cannot be expressed with don't cares. Several problems in logic synthesis, such as Boolean decomposition or multilevel minimization, can be modeled with Boolean ...
Bañeres Besora, David +2 more
core +3 more sources
Quantum algorithms for testing Boolean functions
, 2010 We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani ...
Dominik F. Floess +5 more
core +2 more sources