Last update: Thu Sep 27 02:46:46 MDT 2018
@Article{Galbiati:1981:COB,
author = "G. Galbiati and M. J. Eischer",
title = "On the complexity of $2$-output {Boolean} networks",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "2",
pages = "177--185",
month = nov,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4230B (Combinatorial
switching theory)",
corpsource = "Inst of Mat., Univ. of Pavia, Pavia, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2-output Boolean networks; and-gates; Boolean
functions; combinational complexity; complexity;
monotone networks; not-gates; optimal realizations;
or-gates",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}