The exact circuit complexity of Boolean functions in an infinite basis (Q6970163)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8054080
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The exact circuit complexity of Boolean functions in an infinite basis |
scientific article; zbMATH DE number 8054080 |
Statements
The exact circuit complexity of Boolean functions in an infinite basis (English)
0 references
18 June 2025
0 references
logic (Boolean) circuit
0 references
circuit of functional gates
0 references
circuit complexity
0 references
negation (inversion) complexity
0 references
infinite basis
0 references
0 references
