Notes on unique solutions of boolean equations
D. Banković (1987)
Matematički Vesnik
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Algorithms for Computing the Linearity and Degree of Vectorial Boolean Functions”
Notes on unique solutions of boolean equations
On proper subuniverses of a boolean algebra
Wroński, Stanisław (2015-10-26T10:14:52Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
On Boolean modus ponens.
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].
Triangular solutions of Boolean equations.
Banković, Dragić (1998)
Novi Sad Journal of Mathematics
Similarity:
Separation properties and Boolean powers
Steven Garavaglia, J. M. Plotkin (1984)
Colloquium Mathematicae
Similarity:
On reproductive solutions of Boolean equations.
S. Rudeanu (1970)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
All General Reproductive Solutions of Boolean Equations
Dragić Banković (1989)
Publications de l'Institut Mathématique
Similarity:
A new proof for the multiplicative property of the boolean cumulants with applications to the operator-valued case
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.
On a hierarchy of Boolean functions hard to compute in constant depth.
Bernasconi, Anna (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Large Subalgebras of a Boolean Algebra
Slobodan Vujošević (1989)
Publications de l'Institut Mathématique
Similarity:
On maximal QROBDD's of Boolean functions
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).