No label defined (Q4029626)
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 139645
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 139645 |
Statements
28 March 1993
0 references
switching schemes
0 references
complexity of the Shannon function
0 references
planar schemes
0 references
Boolean functions
0 references
0.8310770392417908
0 references
0.8202490210533142
0 references
[For the entire collection see Zbl 0745.00057.] The paper studies switching schemes based on conjunctions, disjunctions, negations and identify functions. In an earlier paper S. Kravtsov has evaluated the order of the complexity of the Shannon function in the case of planar schemes. The present paper provides exact estimates for the complexity for some special classes of Boolean functions.
0 references
