Lattice Theoretic Properties of Frontal Switching Functions

Cited in

(31)

An improved complexity hierarchy on the depth of Boolean functions
The level polynomials of the free distributive lattices
Characteristic measures of switching functions
Convex subsets of \(2^n\) and bounded truth-table reducibility
An overview of median and stack filtering
Root-signal sets of morphological filters and their use in variable- length BTC image coding
Asymptotics of growth for non-monotone complexity of multi-valued logic function systems
The minimum number of negations in circuits for systems of multi-valued functions
Soft morphological filtering
Identification of fuzzy measures from sample data with genetic algorithms
Theory of majority decision elements
The number of monotone and self-dual Boolean functions.
Entropy, independent sets and antichains: A new approach to Dedekind's problem
scientific article; zbMATH DE number 3918272 (Why is no real title available?)
Number of three-valued logic functions to correct sets of incorrect algorithms and the complexity of interpretation of the functions
Generalisation of Dedekind's problem of the enumeration of coherent structures
The complexity of monotone boolean functions
On the complexity of multivalued logic functions over some infinite basis
Relations between powers of Dedekind numbers and exponential sums related to them
Orders of growth of Shannon functions for circuit complexity over infinite bases
On the counting problem for monotone boolean functions
ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS
Cooperative Boolean systems with generically long attractors I
Clones with finitely many relative \({\mathcal R}\)-classes
A curious new result in switching theory
Improvement of nonmonotone complexity estimates of k-valued logic functions
The exact circuit complexity of Boolean functions in an infinite basis
On Dedekind's problem, a sparse version of Sperner's theorem, and antichains of a given size in the Boolean lattice
Enumerating fuzzy switching functions and free Kleene algebras
An algorithm to construct Gilbert's decomposition and its implementation for the circuit design problem
Forms of representation for simple games: sizes, conversions and equivalences

This page was built for publication: Lattice Theoretic Properties of Frontal Switching Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5826543)