Results 11 to 20 of about 36,413 (311)
Locally monotone Boolean and pseudo-Boolean functions [PDF]
Discrete Applied Mathematics, 2012 We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean ...
Miguel Couceiro +2 more
openaire +6 more sources
Transformations of Boolean Functions. [PDF]
, 2019 Boolean functions are characterized by the unique structure of their solution space. Some properties of the solution space, such as the possible existence of a solution, are well sought after but difficult to obtain. To better reason about such properties, we define transformations as functions that change one Boolean function to another while ...
Jeffrey M. Dudek, Dror Fried
openaire +4 more sources
Advances in Mathematics of Communications, 2019 19 ...
Constanza Riera, Pantelimon Stanica
openaire +4 more sources
The expressibility of functions on the Boolean domain, with applications to Counting CSPs [PDF]
, 2013 An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the notion of a relational clone, which is the set of all relations expressible using primitive positive formulas over a particular set of base relations. Post'
Bulatov, AA +6 more
core +1 more source
Quantum algorithms for testing Boolean functions [PDF]
Electronic Proceedings in Theoretical Computer Science, 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 ...
Erika Andersson +2 more
doaj +1 more source
Random Networks with Quantum Boolean Functions
Mathematics, 2021 We propose quantum Boolean networks, which can be classified as deterministic reversible asynchronous Boolean networks. This model is based on the previously developed concept of quantum Boolean functions.
Mario Franco +3 more
doaj +1 more source
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
Approximate Quantifier Elimination for Propositional Boolean Formulae [PDF]
, 2011 This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining over-approximations of a given formula.
Lijun Zhang +9 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
The complexity of Boolean functions from cryptographic viewpoint [PDF]
, 2006 Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit complexity.
Carlet, Claude
core +1 more source