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:
Janusz Czelakowski (1981)
Colloquium Mathematicae
Similarity:
Steven Garavaglia, J. M. Plotkin (1984)
Colloquium Mathematicae
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].
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.
Banković, Dragić (1998)
Novi Sad Journal of Mathematics
Similarity:
S. Rudeanu (1970)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Dragić Banković (1989)
Publications de l'Institut Mathématique
Similarity:
L. Szczerba (1973)
Fundamenta Mathematicae
Similarity:
Slobodan Vujošević (1989)
Publications de l'Institut Mathématique
Similarity: