Results 21 to 30 of about 76,534 (153)
Approximate Quantifier Elimination for Propositional Boolean Formulae [PDF]
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
An Orthogonal Basis for Functions over a Slice of the Boolean Hypercube [PDF]
We present a simple, explicit orthogonal basis of eigenvectors for the Johnson and Kneser graphs, based on Young's orthogonal representation of the symmetric group. Our basis can also be viewed as an orthogonal basis for the vector space of all functions over a slice of the Boolean hypercube (a set of the form $\{(x_1,\ldots,x_n) \in \{0,1\}^n : \sum_i
openaire +4 more sources
Evolving sensitivity balances Boolean networks [PDF]
We investigate the sensitivity of Boolean Networks (BNs) to mutations. We are interested in Boolean Networks as a model of Gene Regulatory Networks (GRNs). We adopt Ribeiro and Kauffman’s Ergodic Set and use it to study the long term dynamics of a BN. We
Turner, Matthew S. +9 more
core +2 more sources
The average number of hypercubes obtained by each method in each dataset.
Zehua Zhang (312656) +2 more
core +1 more source
Inferring context-sensitive probablistic boolean networks from gene expression data under multi-biological conditions [PDF]
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 +3 more sources
Nonsingular hypercubes and nonintersecting hyperboloids
Some ten years ago we managed to take a first step in the classification of nonsingular 2x2x2x2 hypercubes over a finite field by resolving the special case where the hypercubes can be written as a product of two 2x2x2 hypercubes, i.e., nonsingular ...
Coolsaet, Kris
core +1 more source
DP-Colorings of Uniform Hypergraphs and Splittings of Boolean Hypercube into Faces
We develop a connection between DP-colorings of $k$-uniform hypergraphs of order $n$ and coverings of $n$-dimensional Boolean hypercube by pairs of antipodal $(n-k)$-dimensional faces. Bernshteyn and Kostochka established a lower bound on the number of edges in a non-2-DP-colorable $k$-uniform hypergraph namely, $2^{k-1}$ for odd $k$ and $2^{k-1}+1 ...
openaire +2 more sources
Agent‐Based Modelling of Microbialite Formation Through Sedimentation and Precipitation Dynamics
ABSTRACT Fossil microbialites resulting from the interplay of sedimentation and precipitation are among the oldest evidence of life on Earth and help geobiologists to interpret many sedimentary environments. However, the factors governing their internal structure and external morphology are still poorly understood.
Niall Rodgers +5 more
wiley +1 more source
(2,3)-Cordial Oriented Hypercubes [PDF]
In this article we investigate the existence of (2,3)-cordial labelings of oriented hypercubes. In this investigation, we determine that there exists a (2,3)-cordial oriented hypercube for any dimension divisible by 3.
Santana, Manuel A. +3 more
core
When is the graph of a random 0/1 polytope a clique?
Abstract We study graph‐theoretic properties of random 0/1$0/1$ polytopes. Specifically, let Qpn⊆{0,1}n$Q_p^n \subseteq \lbrace 0,1\rbrace ^n$ be a random subset where each point is included independently with probability p$p$, and consider the graph Gp$G_p$ of the polytope conv(Qpn)$\operatorname{conv}(Q_p^n)$.
Catherine Babecki +2 more
wiley +1 more source

