A pseudo-Boolean viewpoint on systems of representatives
P. L. Ivănescu, S. Rudeanu (1969)
Applicationes Mathematicae
Similarity:
P. L. Ivănescu, S. Rudeanu (1969)
Applicationes Mathematicae
Similarity:
Jelena Bulatović (1982)
Publications de l'Institut Mathématique
Similarity:
S. Rudeanu (1970)
Matematički Vesnik
Similarity:
Gill, J.B. (1986)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
P. L. Ivanescu, S. Rudeanu (1967)
Matematički Vesnik
Similarity:
Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et 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).
Steven Garavaglia, J. M. Plotkin (1984)
Colloquium Mathematicae
Similarity:
D. Banković (1987)
Matematički Vesnik
Similarity:
Wroński, Stanisław (2015-10-26T10:14:52Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
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].
Banković, Dragić (1998)
Novi Sad Journal of Mathematics
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.