Complexity of monotonic functions (Q1820753)
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 3995585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of monotonic functions |
scientific article; zbMATH DE number 3995585 |
Statements
Complexity of monotonic functions (English)
0 references
1985
0 references
In this paper we obtain the asymptotic form of the Shannon function for the complexity of realization, using contact circuits \((L_ k(n))\), formulas in the complete basis \((L^ b_{\vee}(n))\) and circuits of functional elements (FE) in monotone basis \((L_ B(n))\) of monotone Boolean functions (BF) of n variables (only the order was known earlier).
0 references
asymptotic form of the Shannon function
0 references
contact circuits
0 references
circuits of functional elements
0 references
monotone Boolean functions
0 references
0.9526575
0 references
0 references
0.9015632
0 references
0.8982278
0 references
