Pages that link to "Item:Q1114661"
From MaRDI portal
The following pages link to Lower bounds for synchronous circuits and planar circuits (Q1114661):
Displaying 8 items.
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- Through the mincing machine with a Boolean layer cake: nonstandard computations over Boolean circuits in the lower-bounds-to-circuit-size complexity proving (Q1104301) (← links)
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC (Q1317485) (← links)
- On the complexity of planar Boolean circuits (Q1842774) (← links)
- The size and depth of layered Boolean circuits (Q1944075) (← links)
- Communication Complexity and Lower Bounds on Multilective Computations (Q4265538) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q5096789) (← links)