Lower bounds on the area complexity of Boolean circuits (Q1193877)
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 bounds on the area complexity of Boolean circuits |
scientific article; zbMATH DE number 65312
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on the area complexity of Boolean circuits |
scientific article; zbMATH DE number 65312 |
Statements
Lower bounds on the area complexity of Boolean circuits (English)
0 references
27 September 1992
0 references
Boolean circuits
0 references
Boolean functions
0 references
communication complexity
0 references
lower bound
0 references
area complexity
0 references
layout
0 references
0.9335052
0 references
0.92901826
0 references
0.91306984
0 references
0 references
0.9056843
0 references
0.9050591
0 references
0.89733565
0 references
0.89630526
0 references
