Reduction of Depth of Boolean Networks with a Fan-In Constraint
From MaRDI portal
Publication:4135413
DOI10.1109/TC.1977.1674864zbMath0361.94054MaRDI QIDQ4135413
David E. Muller, Amnon B. Barak, Franco P. Preparata
Publication date: 1977
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items
On a relation between the depth and complexity of monotone Boolean formulas, Lower bounds on the depth of monotone arithmetic computations, The delay of circuits whose inputs have specified arrival times