Results 21 to 30 of about 367 (158)
On the planar monotone computation of boolean functions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meurig Beynon, John Buckle
openaire +2 more sources
On orders of two transformation semigroups of the boolean
We consider the semigroup $\mathcal{O}(\mathcal{B}_n)$ of all order-preserving transformations $\varphi : \mathcal{B}_n \rightarrow \mathcal{B}_n$ of ordered by inclusion boolean $\mathcal{B}_n$ of $n$-element set (i.e.
I.V. Livinsky, T.G. Zhukovska
doaj +1 more source
The monotone circuit complexity of boolean functions
Some new results concerning lower bounds for the complexity of monotone circuits that detect cliques in graphs are obtained using modified versions of known methods. It is shown that even a very rough approximation of the maximum clique size of a graph, requires superpolynomial size of monotone circuits.
Noga Alon, Ravi B. Boppana
openaire +2 more sources
Representations of Monotone Boolean Functions by Linear Programs [PDF]
We introduce the notion of monotone linear programming circuits (MLP circuits), a model of computation for partial Boolean functions. Using this model, we prove the following results. 1 (1) MLP circuits are superpolynomially stronger than monotone Boolean circuits.
Mateus de Oliveira Oliveira +1 more
openaire +6 more sources
Monotone, Horn and Quadratic Pseudo-Boolean Functions [PDF]
JUCS - Journal of Universal Computer Science Volume Nr.
Foldes,Stephan, Hammer,Peter
openaire +2 more sources
Ceilings of Monotone Boolean Functions
JUCS - Journal of Universal Computer Science Volume Nr.
openaire +3 more sources
Influences of monotone Boolean functions
Recently, Keller and Pilpel conjectured that the influence of a monotone Boolean function does not decrease if we apply to it an invertible linear transformation. Our aim in this short note is to prove this conjecture.
openaire +2 more sources
Blocks of Monotone Boolean Functions [PDF]
This paper first proposed the method of constructing blocks of monotone Boolean functions (MBFs) is developed for classification and the analysis of these functions. Use of only nonisomorphic blocks considerably simplifies enumeration MBFs. Application of the method of construction blocks on the example of classification and analysis of MBFs from 0 to ...
Tkachenco V.G., Sinyavsky O.V.
openaire +1 more source
Strain‐Modulated Reconfigurable Optical Information Processing in Flexible Graphene/PDMS
Graphene/PDMS—a stable, mechanically robust, and highly tunable flexible composite, exhibits excellent strain‐tunability. The spatial self‐phase modulation (SSPM) effect can be reversibly and continuously modulated by strain. A strain‐gated optical switch can be constructed, thereby realizing reconfigurable optical logic gates and reversible switching ...
Zexin Cui +13 more
wiley +1 more source
Bio‐Based Polyurethanes for Sustainable and Multifunctional Applications
Bio‐based polyurethanes prepared from vegetable oils, lignin, and polysaccharides have attracted increasing interest as alternatives to fossil‐derived polyurethanes. This review summarizes recent progress in their chemistry, structural engineering, and advanced applications, highlighting the roles of feedstocks, chain‐segment design, dynamic covalent ...
Xin Li +6 more
wiley +1 more source

