Results 21 to 30 of about 2,786,322 (296)
On the Lyapunov Exponent of Monotone Boolean Networks †
Mathematics, 2020 Boolean networks are discrete dynamical systems comprised of coupled Boolean functions. An important parameter that characterizes such systems is the Lyapunov exponent, which measures the state stability of the system to small perturbations.
Ilya Shmulevich
doaj +1 more source
A New Family of Boolean Functions with Good Cryptographic Properties
Axioms, 2021 In 2005, Philippe Guillot presented a new construction of Boolean functions using linear codes as an extension of the Maiorana–McFarland’s (MM) construction of bent functions.
Guillermo Sosa-Gómez +3 more
doaj +1 more source
Symmetry Properties of Nested Canalyzing Functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Many researchers have studied symmetry properties of various Boolean functions. A class of Boolean functions, called nested canalyzing functions (NCFs), has been used to model certain biological phenomena.
Daniel J. Rosenkrantz +3 more
doaj +1 more source
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-
Floess, Dominik +2 more
core +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
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
Inferring context-sensitive probablistic boolean networks from gene expression data under multi-biological conditions [PDF]
, 2007 In recent years biological microarrays have emerged as a high-throughput data acquisition technology in bioinformatics. In conjunction with this, there is an increasing need to develop frameworks for the formal analysis of biological pathways. A modeling
Marshall, Stephen, Yu, Le
core +4 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
06111 Executive Summary – Complexity of Boolean Functions [PDF]
, 2006 We briefly describe the state of the art concerning the complexity of discrete functions. Computational models and analytical techniques are summarized. After describing the formal organization of the Dagstuhl seminar "Complexity of Boolean Functions"
van Melkebeek, Dieter +3 more
core +1 more source
06111 Abstracts Collection – Complexity of Boolean Functions [PDF]
, 2006 From 12.03.06 to 17.03.06, the Dagstuhl Seminar 06111 ``Complexity of Boolean Functions'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research,
van Melkebeek, Dieter +3 more
core +1 more source