The planar realization of Boolean functions
From MaRDI portal
Publication:1095874
DOI10.1016/0020-0190(87)90180-3zbMath0632.94032MaRDI 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
DB lookup for MSC labels failed
Related Items
A nonlinear lower bound on the practical combinational complexity, Nonlinear lower bounds on the number of processors of circuits with sublinear separators, Lower bounds on the area complexity of Boolean circuits, On the complexity of planar Boolean circuits