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:
Bernasconi, Anna (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
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].
Steven Garavaglia, J. M. Plotkin (1984)
Colloquium Mathematicae
Similarity:
Banković, Dragić (1998)
Novi Sad Journal of Mathematics
Similarity:
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).
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.
S. Rudeanu (1970)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Dragić Banković (1989)
Publications de l'Institut Mathématique
Similarity:
Ž. Mijajlović (1974)
Matematički Vesnik
Similarity: