A Complete Boolean Algebra without Homogeneous or Rigid Factors.
Sabine Koppelberg (1978)
Mathematische Annalen
Similarity:
Displaying similar documents to “A Measure for Semialgebraic Sets Related to Boolean Complexity.”
A Complete Boolean Algebra without Homogeneous or Rigid Factors.
A Characterisation of Boolean Extension of Universal Algebras
P.V. Jagannadham (1967)
Mathematische Annalen
Similarity:
Linear Transformations in a Boolean Vector Space
P. V. Jagannadham (1966)
Mathematische Annalen
Similarity:
On the depth of Boolean functions that can be realized by switching circuits of given complexity
Н. Н. Кузюрин (1988)
Banach Center Publications
Similarity:
Structure theory for a generalised Boolean ring.
N.V. SUBRAHMANYAM (1960)
Mathematische Annalen
Similarity:
Measure-determined enlargements of Boolean -algebras
Pavel Pták (1990)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
An Extension of Boolean Lattice Theory.
N.V. SUBRAHMANYAM (1963)
Mathematische Annalen
Similarity:
On measures in cartesian products of Boolean algebras
Roman Sikorski (1951)
Colloquium Mathematicum
Similarity:
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:
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).