Results 31 to 40 of about 148,474 (293)
Boolean differential operators
TURKISH JOURNAL OF MATHEMATICS, 2018 18 páginas, 1 ...
Hernández Encinas, Luis +1 more
openaire +2 more sources
Linear operators that preserve Boolean rank of Boolean matrices [PDF]
Czechoslovak Mathematical Journal, 2013 Let \(A,B,C\) be Boolean matrices such that \(A=BC\), and let \(k\) be the number of columns of \(B\) (equal to the number of rows of \(C\)). For given \(A\), the minimum \(k\) for which \(B,C\) exist is called the Boolean rank of \(A\). In [Linear Algebra Appl. 59, 55--77 (1984; Zbl 0536.20044)] \textit{L. B. Beasley} and \textit{N. J. Pullman} showed
Beasley, LeRoy B., Song, Seok-Zun
openaire +2 more sources
Functions Definable by Numerical Set-Expressions
, 2009 A "numerical set-expression" is a term specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. If these operations are confined to the usual Boolean operations together with the result of lifting ...
Düntsch, Ivo, Pratt-Hartmann, Ian
core +1 more source
A topological characterization of an almost Boolean algebra
Extracta MathematicaeFor any Boolean space X and a discrete almost distributive lattice D, it is proved that the set C(X, D) of all continuous mappings of X into D, when D is equipped with the discrete topology, is an almost Boolean algebra under pointwise operations ...
K. Ramanuja Rao +3 more
doaj +1 more source
An Oracle-Based Framework for Implementing a Quantum Parallel Decoder/Multiplexer
IEEE Access, 2023 Quantum computers excel at solving complex computational problems more efficiently than conventional supercomputers. However, a significant challenge in quantum computing is implementing key operations of conventional computers, such as arithmetic ...
Stavros Souravlas +2 more
doaj +1 more source
Symmetric Groups and Quotient Complexity of Boolean Operations [PDF]
, 2013 The quotient complexity of a regular language L is the number of left quotients of L, which is the same as the state complexity of L. Suppose that L and L' are binary regular languages with quotient complexities m and n, and that the transition ...
A. Restivo +11 more
core +1 more source
Harnessing Fungal Biowelding for Constructing Mycelium‐Engineered Materials
Advanced Engineering Materials, EarlyView.Mycelium‐bound composites (MBCs) offer low‐carbon alternatives for construction, yet interfacial bonding remains a critical challenge. This review examines fungal biowelding as a biocompatible adhesive, elucidating mycelium‐mediated interfacial mechanisms and their role in material assembly. Strategies to optimize biowelding are discussed, highlighting
Xue Brenda Bai +2 more
wiley +1 more source
Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover [PDF]
, 2013 Stochastic Boolean Function Evaluation is the problem of determining the value of a given Boolean function f on an unknown input x, when each bit of x_i of x can only be determined by paying an associated cost c_i.
Deshpande, Amol +2 more
core +1 more source
Advanced Functional Materials, EarlyView.Edible electronics needs integrated logic circuits for computation and control. This work presents a potentially edible printed chitosan‐gated transistor with a design optimized for integration in circuits. Its implementation in integrated logic gates and circuits operating at low voltage (0.7 V) is demonstrated, as well as the compatibility with an ...
Giulia Coco +8 more
wiley +1 more source
Initialization-Free Programmable Spin-Logic Gate in a Single Spin-Orbit Torque Device
EngineeringIn-memory computing (IMC) based on spin-logic devices is regarded as an advantageous way to optimize the Von Neumann bottleneck. However, performing complete Boolean logic with spintronic devices typically requires an initialization operation, which can ...
Jie Lin +15 more
doaj +1 more source