A new lower bound on the monotone network complexity of Boolean sums (Q1137007)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3666684
Language Label Description Also known as
default for all languages
No label defined
    English
    A new lower bound on the monotone network complexity of Boolean sums
    scientific article; zbMATH DE number 3666684

      Statements

      A new lower bound on the monotone network complexity of Boolean sums (English)
      0 references
      0 references
      1980
      0 references
      monotone network complexity of Boolean functions
      0 references
      Boolean sums
      0 references
      lower bound
      0 references

      Identifiers