On the complexity of realization of partial Boolean functions by circuits of functional elements (Q3360808): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1515/dma.1991.1.3.251 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1515/dma.1991.1.3.251 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010704148 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1515/DMA.1991.1.3.251 / rank | |||
Normal rank | |||
Latest revision as of 02:50, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of realization of partial Boolean functions by circuits of functional elements |
scientific article |
Statements
On the complexity of realization of partial Boolean functions by circuits of functional elements (English)
0 references
1991
0 references
combinational complexity
0 references
Shannons function
0 references
Boolean circuits
0 references
computing partial Boolean functions
0 references
