Some Remarks On Boolean Terms - Model Theoretic Approach
Žarko Mijajlović (1977)
Publications de l'Institut Mathématique
Similarity:
Žarko Mijajlović (1977)
Publications de l'Institut Mathématique
Similarity:
Bernasconi, Anna (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
A. Kościelski (1973)
Colloquium Mathematicae
Similarity:
Bouyuklieva, Stefka, Bouyukliev, Iliya (2016)
Serdica Journal of Computing
Similarity:
In this article, we study two representations of a Boolean function which are very important in the context of cryptography. We describe Möbius and Walsh Transforms for Boolean functions in details and present effective algorithms for their implementation. We combine these algorithms with the Gray code to compute the linearity, nonlinearity and algebraic degree of a vectorial Boolean function. Such a detailed consideration will be very helpful for students studying the design of block...
Sergiu Rudeanu (1998)
Mathware and Soft Computing
Similarity:
An abstract form of modus ponens in a Boolean algebra was suggested in [1]. In this paper we use the general theory of Boolean equations (see e.g. [2]) to obtain a further generalization. For a similar research on Boolean deduction theorems see [3].
Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).
L. Szczerba (1973)
Fundamenta Mathematicae
Similarity:
Marko Mirković, Janko Hodolič, Dragan Radojević (2006)
The Yugoslav Journal of Operations Research
Similarity:
Mihai Popa (2009)
Colloquium Mathematicae
Similarity:
The paper presents several combinatorial properties of the boolean cumulants. A consequence is a new proof of the multiplicative property of the boolean cumulant series that can be easily adapted to the case of boolean independence with amalgamation over an algebra.
Н. Н. Кузюрин (1988)
Banach Center Publications
Similarity:
D. Banković (1987)
Matematički Vesnik
Similarity:
Paul R. Halmos (1954-1956)
Compositio Mathematica
Similarity: