Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Keller-Gehrig:1985:FAC,
author = "W. Keller-Gehrig",
title = "Fast algorithms for the characteristic polynomial",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "309--317",
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 = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "characteristic polynomial; computational complexity;
fast algorithms; matrix multiplication; polynomials",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}