Results 21 to 30 of about 5,251,527 (295)
Algorithms, 2022 There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers.
Aleksey I. Pakhomchik +3 more
doaj +1 more source
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
An Anytime Symmetry Detection Algorithm for ROBDDs [PDF]
, 2006 Detecting symmetries is crucial to logic synthesis, technology mapping, detecting function equivalence under unknown input correspondence, and ROBDD minimization. State-of-the-art is represented by Mishchenko's algorithm.
Kettle, Neil +3 more
core +1 more source
On the algebraic immunity of multiplexer Boolean functions
Journal of Mathematical Cryptology, 2022 A multiplexer generator is a device that accepts two or more inputs and based on some logic sends one of them as output. In a special case when inputs to a multiplexer generator are 2k{2}^{k} bits and one of them is selected according to the value of a ...
Mishra Prasanna R., Pandey Shashi Kant
doaj +1 more source
On Resilient Boolean and Vectorial Boolean Functions with High Nonlinearity
Mathematics, 2022 Boolean functions and vectorial Boolean functions are the most important nonlinear components of stream ciphers. They should satisfy several criteria such as high nonlinearity, proper resiliency and so on to guarantee the security of the whole system ...
Luyang Li +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
Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
Informatika, 2022 O b j e c t i v e s . The problem of synthesis of combinational circuits in the basis of two-input gates is considered. Those gates are AND, OR, NAND and NOR.
Yu. V. Pottosin
doaj +1 more source
Further research results on confusion coefficient of Boolean functions
Journal of Mathematical Cryptology, 2023 The notion of confusion coefficient (CC) is a property that attempts to characterize the confusion property of cryptographic algorithms against differential power analysis.
Liu Zhenyu, Zhuo Zepeng
doaj +1 more source
On the Power of Choice for Boolean Functions
SIAM Journal on Discrete Mathematics, 2022 In this paper we consider a variant of the well-known Achlioptas process for graphs adapted to monotone Boolean functions. Fix a number of choices $r\in \mathbb N$ and a sequence of increasing functions $(f_n)_{n\ge 1}$ such that, for every $n\ge 1$, $f_n:\{0,1\}^n\mapsto \{0,1\}$.
Nicolas Fraiman +2 more
openaire +3 more sources
Tongxin xuebao, 2010 Took the derivative and e-derivative of Boolean function as a tool,analyzed the inner structure of balanced H-Boolean functions,clearly obtained the conclusion that the second-order correlation-immune balanced H-Boolean function is not existent,solved ...
HE Liang, WANG Zhuo, LI Wei-wei
doaj +2 more sources