The following pages link to (Q3684036):
Displaying 7 items.
- Planar acyclic computation (Q751805) (← links)
- On the planar monotone computation of Boolean functions (Q1099134) (← links)
- Functions computed by monotone Boolean formulas with no repeated variables (Q1121854) (← links)
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
- Lower bounds on the area complexity of Boolean circuits (Q1193877) (← links)
- On the complexity of planar Boolean circuits (Q1842774) (← links)
- Freezing sandpiles and Boolean threshold networks: equivalence and complexity (Q2020018) (← links)
