On the complexity of realization of the linear function by formulas over finite Boolean bases (Q4522865): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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.2000.10.2.147 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2129421712 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:00, 20 March 2024
scientific article; zbMATH DE number 1548671
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of realization of the linear function by formulas over finite Boolean bases |
scientific article; zbMATH DE number 1548671 |
Statements
On the complexity of realization of the linear function by formulas over finite Boolean bases (English)
0 references
26 July 2001
0 references
Boolean functions
0 references
bases
0 references
complexity of realization
0 references
lower bound
0 references
