A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer lattice (Q4522743)
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 1548561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer lattice |
scientific article; zbMATH DE number 1548561 |
Statements
A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer lattice (English)
0 references
7 March 2001
0 references
complexity
0 references
Boolean functions
0 references
planar two-layer contact circuits
0 references
universal Nechiporuk function
0 references
0.8677632212638855
0 references
0.8247461915016174
0 references
