Lower bound of circuit complexity of parity function in a basis of unbounded fan-in (Q2131416)
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: Lower bound of circuit complexity of parity function in a basis of unbounded fan-in |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bound of circuit complexity of parity function in a basis of unbounded fan-in |
scientific article |
Statements
Lower bound of circuit complexity of parity function in a basis of unbounded fan-in (English)
0 references
26 April 2022
0 references
Boolean circuits
0 references
circuit complexity
0 references
parity function
0 references
minimal circuit
0 references
0 references
