Asymptotically best method for synthesis of Boolean recursive circuits (Q783110): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1515/DMA-2020-0013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1515/DMA-2020-0013 / rank | |||
Normal rank | |||
Latest revision as of 03:32, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotically best method for synthesis of Boolean recursive circuits |
scientific article |
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
