The planar realization of Boolean functions
From MaRDI portal
Publication:1095874
DOI10.1016/0020-0190(87)90180-3zbMath0632.94032OpenAlexW1990215785MaRDI QIDQ1095874
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90180-3
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)
Related Items (5)
Nonlinear lower bounds on the number of processors of circuits with sublinear separators ⋮ A nonlinear lower bound on the practical combinational complexity ⋮ Lower bounds on the area complexity of Boolean circuits ⋮ A nonlinear lower bound on the practical combinational complexity ⋮ On the complexity of planar Boolean circuits
Cites Work
This page was built for publication: The planar realization of Boolean functions
