Lower bounds for synchronous circuits and planar circuits (Q1114661): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Explicit constructions of linear-sized superconcentrators / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An n logn Lower Bound on Synchronous Combinational Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower Bounds on Synchronous Combinational Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Separator Theorem for Planar Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Applications of a Planar Separator Theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3691585 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4773296 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universal circuits (Preliminary Report) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3762226 / rank | |||
Normal rank |
Latest revision as of 12:45, 19 June 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