Pages that link to "Item:Q1193877"
From MaRDI portal
The following pages link to Lower bounds on the area complexity of Boolean circuits (Q1193877):
Displaying 6 items.
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- Linear lower bounds on unbounded fan-in Boolean circuits (Q1068792) (← links)
- Lower bounds for synchronous circuits and planar circuits (Q1114661) (← links)
- On the complexity of planar Boolean circuits (Q1842774) (← links)
- Explicit lower bound of <i>4.5n - o(n)</i> for boolena circuits (Q5175995) (← links)
- Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model (Q6548992) (← links)