Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Averbuch:1988:CAM,
author = "Amir Averbuch and Zvi Galil and Shmuel Winograd",
title = "Classification of all the minimal bilinear algorithms
for computing the coefficients of the product of two
polynomials modulo a polynomial. {Part I}. The algebra
{$G[u]/<Q(u)^\ell>,\ell>1$}",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "17--56",
month = jun,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "IBM Thomas J. Watson Research Cent",
affiliationaddress = "Yorktown Heights, NY, USA",
classification = "723; 921; C4240 (Programming and algorithm theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; classification; Coefficients of
Polynomials; computational complexity; Computer
Programming; Mathematical Techniques--Polynomials;
Minimal Bilinear Algorithms; minimal bilinear
algorithms; Noncommutative Algorithms; polynomials;
Polynomials Products",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}