Results 21 to 30 of about 40,553 (242)
Partial Boolean Functions With Exact Quantum Query Complexity One
Entropy, 2021 We provide two sufficient and necessary conditions to characterize any n-bit partial Boolean function with exact quantum query complexity 1. Using the first characterization, we present all n-bit partial Boolean functions that depend on n bits and can be
Guoliang Xu, Daowen Qiu
doaj +1 more source
The Zhegalkin Polynomial of Multiseat Sole Sufficient Operator
Моделирование и анализ информационных систем, 2023 Among functionally complete sets of Boolean functions, sole sufficient operators are of particular interest. They have a wide range of applicability and are not limited to the two-seat case.
Leonid Y. Bystrov, Egor V. Kuzmin
doaj +1 more source
Tongxin xuebao, 2010 Took the derivative and e-derivative of Boolean function as a tool,analyzed the inner structure of balanced H-Boolean functions,clearly obtained the conclusion that the second-order correlation-immune balanced H-Boolean function is not existent,solved ...
HE Liang, WANG Zhuo, LI Wei-wei
doaj +2 more sources
Relationship between correlation immune and weight of H Boolean functions
Tongxin xuebao, 2012 The Boolean function derivative and e-derivative which together with the derivative so that the weight of Boolean functions can be directly clear characterized and defined as the tools for research and deep into the internal structure of Boolean function
Jing-lian HUANG, Zhuo WANG
doaj +2 more sources
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
Математическая логика: построение логических схем из логических элементов в Maple
Vestnik KRAUNC: Fiziko-Matematičeskie Nauki, 2021 В статье рассматриваются возможности применения библиотеки Logic системы компьютерной алгебры Maple в аспекте компьютерного моделирования логических схем в различных базисах. Смоделированы основные логические элементы в Maple.
Оленев, А.А. +2 more
doaj +1 more source
Join-Irreducible Boolean Functions [PDF]
Order, 2010 The current manuscript constitutes an extension to the paper "Irreducible Boolean Functions" (arXiv:0801.2939v1)
Bouaziz, Moncef +2 more
openaire +3 more sources
, 2011 Written by prominent experts in the field, this monograph provides the first comprehensive, unified presentation of the structural, algorithmic and applied aspects of the theory of Boolean functions. The book focuses on algebraic representations of Boolean functions, especially disjunctive and conjunctive normal form representations.
Crama, Yves, Hammer, Peter L.
openaire +3 more sources
Minimization of Boolean functions in the class of orthogonal disjunctive normal forms
Informatika, 2021 The orthogonal disjunctive normal forms (DNFs) of Boolean functions have wide applications in the logical design of discrete devices. The problem of DNF orthogonalization is to get for a given function such a DNF that any two its terms would be ...
Yu. V. Pottosin
doaj +1 more source
A Characterization of Generalized Boolean Functions Employed in CDMA Communications [PDF]
International Journal of Mathematical, Engineering and Management SciencesIn design of secure cryptosystems and CDMA communications, the negabent functions play a significant role. The generalized Boolean functions have been extensively studied by Schmidt and established several important results in this setup.
Deep Singh +3 more
doaj +1 more source