Entry Averbuch:1988:CAM from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@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",
}
Related entries
- algebra,
35(1)89,
35(2)329,
36(2)203,
37(1)77,
37(3)269,
39(1)69,
39(2)135,
40(2)329,
41(1)109,
43(1)117,
43(2)123,
43(2)149,
43(2)189,
44(3)333,
46(1)67,
46(2)285,
50(2)137,
50(3)323,
51(1)229,
51(3)331,
52(1)59,
52(3)307,
53(1)125,
53(1)z,
54(1)65,
54(1)103,
56(1)37,
57(1)3,
57(1)147,
59(3)277,
63(3)253,
63(3)275,
64(2)135,
64(2)159,
65(2)243,
67(1)87,
67(1)115,
68(3)347
- all,
40(2)163,
52(3)341
- bilinear,
61(2)299
- classification,
36(2)145,
36(2)217,
47(2)121,
65(2)143,
65(2)z
- coefficient,
41(2)289,
44(1)1,
65(2)131
- computing,
40(2)275,
41(1)81,
53(1)151,
54(2)315,
56(1)3,
58(0)3,
58(1)249,
63(2)203,
64(1)107,
64(3)271
- Galil, Zvi,
64(1)107
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- minimal,
35(1)17,
35(2)261,
36(2)203,
36(2)345,
43(2)189,
50(2)183,
51(3)265,
60(3)285,
63(1)1,
67(1)65
- modulo,
59(1)115,
64(3)271,
67(1)19,
67(2)173
- noncommutative,
46(2)319
- part,
63(3)275,
68(1)49
- Polynomials, Techniques-,
64(1)15,
67(1)111
- product,
38(2)223,
46(1)91,
47(1)1,
48(1)1,
48(2)183,
50(2)103,
52(1)59,
53(2)243,
61(1)17,
64(2)203,
64(3)221,
65(2)189,
65(2)z
- Techniques--Polynomials,
64(1)15,
67(1)111
- two,
37(1)51,
38(2)167,
40(2)319,
46(1)101,
47(2)191,
47(3)237,
49(1)81,
58(1)361,
61(1)67,
62(3)235,
63(1)1,
63(2)141,
63(2)157,
64(1)39,
66(3)233