Lower bounds for synchronous circuits and planar circuits (Q1114661): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:30, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for synchronous circuits and planar circuits |
scientific article |
Statements
Lower bounds for synchronous circuits and planar circuits (English)
0 references
1989
0 references
It is shown that there exist explicitly defined one-output Boolean functions \(f_ n\) and \(g_ n\) with circuit complexity O(n) such that the synchronous circuit complexity of \(f_ n\) is \(\Omega\) (n log n) and the planar circuit complexity of \(g_ n\) is \(\Omega (n^ 2)\).
0 references
one-output Boolean functions
0 references
synchronous circuit complexity
0 references
planar circuit complexity
0 references
