Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Snir:1991:SDT,
author = "M. Snir",
title = "Size-depth trade-offs for monotone arithmetic
circuits",
journal = j-THEOR-COMP-SCI,
volume = "82",
number = "1",
pages = "85--93",
day = "22",
month = may,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; linear recurrences;
matrices; matrix algebra; monotone arithmetic circuits;
size depth trade offs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}