No label defined (Q3684035)
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 3906394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3906394 |
Statements
1985
0 references
planar circuit size
0 references
n-argument Boolean functions
0 references
0.7983430027961731
0 references
0.7666488885879517
0 references
0.7434179782867432
0 references
[For the entire collection see Zbl 0561.00020.] A counting argument is used to establish a lower bound of \(\Omega (2^ n)\) on the planar circuit size of almost all n-argument Boolean functions. The counting argument exploits the fact that planar circuits can be more concisely specified than general circuits.
0 references