Results 21 to 30 of about 148,474 (293)
Boolean Differential Operators
, 2012 We consider four combinatorial interpretations for the algebra of Boolean differential operators. We show that each interpretation yields an explicit matrix representation for Boolean differential operators.
Catumba, Jorge, Díaz, Rafael
openaire +3 more sources
Современные информационные технологии и IT-образование, 2019 We consider vector mappings over the set of 0 and 1 given by the set of Boolean functions. Boolean functions included in the map are given in ANF. Having fixed the rule according to which the binary vectors are associated with the elements of a finite ...
Sergey A. Belov
doaj +1 more source
Most Complex Non-Returning Regular Languages [PDF]
, 2017 A regular language $L$ is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state.
B Krawetz +11 more
core +4 more sources
A Graph-theoretic Method to Define any Boolean Operation on Partitions [PDF]
, 2019 The lattice operations of join and meet were defined for set partitions in the nineteenth century, but no new logical operations on partitions were defined and studied during the twentieth century. Yet there is a simple and natural graph-theoretic method
Ellerman, David
core +3 more sources
Hierarchies of resources for measurement-based quantum computation
New Journal of Physics, 2023 For certain restricted computational tasks, quantum mechanics provides a provable advantage over any possible classical implementation. Several of these results have been proven using the framework of measurement-based quantum computation (MBQC), where ...
Markus Frembs +3 more
doaj +1 more source
Boolean derivatives and computation of cellular automata
, 2000 The derivatives of a Boolean function are defined up to any order. The Taylor and MacLaurin expansions of a Boolean function are thus obtained. The last corresponds to the ring sum expansion (RSE) of a Boolean function, and is a more compact form than ...
Bagnoli, Franco
core +1 more source
How to avoid a compact set [PDF]
, 2017 A first-order expansion of the $\mathbb{R}$-vector space structure on $\mathbb{R}$ does not define every compact subset of every $\mathbb{R}^n$ if and only if topological and Hausdorff dimension coincide on all closed definable sets. Equivalently, if $A \
Fornasiero, Antongiulio +2 more
core +2 more sources
PolygonTailor: A Parallel Algorithm for Polygon Boolean Operations in IC Layout Processing
AlgorithmsPolygon Boolean operations are widely used in integrated circuit (IC) layout processing tasks such as design rule checking (DRC) and optical proximity correction (OPC).
Zhirui Niu +5 more
doaj +1 more source
A Method for Determining the Affine Equivalence of Boolean Functions
IEEE Access, 2019 Determining the affine equivalence of Boolean functions has significant applications in circuit and cryptography. Previous methods for determining this require a large amount of computation when Boolean functions are bent functions or when the truth ...
Ziyu Wang +3 more
doaj +1 more source
Brownian reservoir computing realized using geometrically confined skyrmion dynamics
Nature Communications, 2022 Magnetic skyrmions, due to their strongly nonlinearity and multiscale dynamics, are promising for implementing reservoir computing. Here, the authors experimentally demonstrate skyrmion-based spatially multiplexed reservoir computing able to perform ...
Klaus Raab +7 more
doaj +1 more source