Results 211 to 220 of about 24,202 (263)

Modular Control of Boolean Network Models. [PDF]

Bull Math Biol
Murrugarra D, Veliz-Cuba A, Dimitrova E, Kadelka C, Wheeler M, Laubenbacher R.   +5 more
europepmc   +1 more source

Iterative design of a NAND hybrid riboswitch by deep batch Bayesian optimization. [PDF]

Nucleic Acids Res
Kelvin D, Kubaczka E, Karava M, Koeppl H, Suess B.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Graph Functions of Boolean Functions

IEEE Transactions on Computers, 1984
We introduce and characterize those Boolean functions (graph functions) which can be regarded as characteristic functions of graphs of other Boolean functions. An algorithm for detecting these functions is also presented. Finally, we discuss the complexity of computing a Boolean function which can be regarded as a graph function.
Reischer, Corina, Simovici, Dan A.
openaire   +2 more sources

Invertible Boolean Functions

IEEE Transactions on Electronic Computers, 1964
This paper describes a group theoretic approach to count the number of equivalence classes of invertible Boolean functions under the group operation of complementation, permutation, combinations of complementation and permutation, and linear and affine transformations.
openaire   +2 more sources

Monotone Boolean functions

Russian Mathematical Surveys, 2003
Summary: Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published.
openaire   +2 more sources

SUPER-BOOLEAN FUNCTIONS AND FREE BOOLEAN QUASILATTICES

Discrete Mathematics, Algorithms and Applications, 2014
A Boolean quasilattice is an algebra with hyperidentities of the variety of Boolean algebras. In this paper, we give a functional representation of the free n-generated Boolean quasilattice with two binary, one unary and two nullary operations. Namely, we define the concept of super-Boolean function and prove that the free Boolean quasilattice with two
Movsisyan, Yu. M., Aslanyan, V. A.
openaire   +2 more sources

Boolean Functions Without Boolean Operators

1989
The motivation for working without Boolean operators can mostly be found in the field of Boolean stochastics which will be treated in §§8 and 9. In the present chapter stochastic aspects will be precluded. Even today practical workers in many fields who apply Boolean functions are easily frustrated by the very idea of working without Boolean operators.
openaire   +1 more source

Boolean Functions as Models for Quantified Boolean Formulas

Journal of Automated Reasoning, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kleine Büning, Hans, Subramani, K., Zhao, Xishun   +2 more
openaire   +1 more source

Almost Boolean functions: the design of Boolean functions by spectral inversion

The 2003 Congress on Evolutionary Computation, 2003. CEC '03., 2004
The design of Boolean functions with properties of cryptographic significance is a hard task. In this paper, we adopt an unorthodox approach to the design of such functions. Our search space is the set of functions that possess the required properties. It is “Boolean‐ness” that is evolved.
John A. Clark, Jeremy L. Jacob, Subhamoy Maitra, Pantelimon Stănică   +3 more
openaire   +1 more source

On learning Boolean functions

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87, 1987
Robotics ...
openaire   +1 more source