Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits (Q1173769)

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 7393
Language Label Description Also known as
default for all languages
No label defined
    English
    Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits
    scientific article; zbMATH DE number 7393

      Statements

      Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits (English)
      0 references
      25 June 1992
      0 references
      See the review in Zbl 0712.68053.
      0 references
      lower bounds
      0 references
      nondeterministic branching programs
      0 references
      symmetric Boolean functions
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references