On the complexity of Boolean functions with small number of ones (Q3409861): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| label / en | label / en | ||
On the complexity of Boolean functions with small number of ones | |||
| 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.1163/1569392043272511 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079867592 / rank | |||
Normal rank | |||
| Property / title | |||
On the complexity of Boolean functions with small number of ones (English) | |||
| Property / title: On the complexity of Boolean functions with small number of ones (English) / rank | |||
Normal rank | |||
Latest revision as of 02:06, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of Boolean functions with small number of ones |
scientific article |
Statements
20 November 2006
0 references
Finikov method
0 references
minimal circuits
0 references
On the complexity of Boolean functions with small number of ones (English)
0 references
