scientific article
From MaRDI portal
Publication:3684036
zbMath0567.94016MaRDI QIDQ3684036
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (7)
On the planar monotone computation of Boolean functions ⋮ Functions computed by monotone Boolean formulas with no repeated variables ⋮ Nonlinear lower bounds on the number of processors of circuits with sublinear separators ⋮ Lower bounds on the area complexity of Boolean circuits ⋮ Freezing sandpiles and Boolean threshold networks: equivalence and complexity ⋮ Planar acyclic computation ⋮ On the complexity of planar Boolean circuits
This page was built for publication: