Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Alt:1985:MEN,
author = "H. Alt",
title = "Multiplication is the easiest nontrivial arithmetic
function",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "333--339",
month = apr,
year = "1985",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean circuit; Boolean functions; Boolean
operations; fixed point multiplication; nontrivial
arithmetic function",
pubcountry = "Netherlands A12",
treatment = "T Theoretical or Mathematical",
}