Results 31 to 40 of about 1,460,452 (290)
Correlated Boolean Operators for Uncertainty Logic
, 2022 We present a correlated \textit{and} gate which may be used to propagate uncertainty and dependence through Boolean functions, since any Boolean function may be expressed as a combination of \textit{and} and \textit{not} operations. We argue that the \textit{and} gate is a bivariate copula family, which has the interpretation of constructing bivariate ...
Enrique Miralles-Dolz +3 more
openaire +4 more sources
Formulation for the computation of Boolean operations
, 2001 Boolean or switching equations are powertul mathematical tools for digital logic. Several problems in digital circuit design, such as automatic test pattern generation, could be efficiently solved if fast procedures for solving Boolean equations were ...
Sánchez, JM, Imaña Pascual, José Luis
core +1 more source
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
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
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
Nondeterminism and boolean operations in pda's
Journal of Computer and System Sciences, 1978 AbstractThere are nondeterministic context-free languages that cannot be expressed as a Boolean formula over deterministic context-free languages. The closure of the context-free languages under intersection does not yield closure under complementation.
openaire +1 more source
Index sets and Boolean operations [PDF]
Proceedings of the American Mathematical Society, 1982 Hay’s thesis asserts that every naturally defined class of sets of natural numbers contains an index set which is 1 1 -complete for that class and that every index set is 1 1 -complete for some naturally defined class. We formalize "naturally defined" as "effective Boolean" and establish the thesis as a Metatheorem.
openaire +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
Advanced Engineering Materials, EarlyView.This article explores the transformative potential of symbolic artificial intelligence (AI) in the field of materials science, particularly in leveraging experimental data. The article presents several symbolic AI models and discusses their applications in materials science.
Ahmed Amrani +7 more
wiley +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