Asymptotically best method for synthesis of Boolean recursive circuits (Q783110)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Asymptotically best method for synthesis of Boolean recursive circuits |
scientific article; zbMATH DE number 7226068
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotically best method for synthesis of Boolean recursive circuits |
scientific article; zbMATH DE number 7226068 |
Statements
Asymptotically best method for synthesis of Boolean recursive circuits (English)
0 references
30 July 2020
0 references
recursive circuits of gates
0 references
complexity of Boolean functions
0 references
Shannon function
0 references
asymptotic estimates
0 references
0.9400734
0 references
0.92991245
0 references
0.8807131
0 references
0.8704073
0 references
0.8603803
0 references
0.85912013
0 references
