Fast computation of generic bivariate resultants
[ Homepage | Publications | Talks | TeXmacs | Mathemagix ]


We prove that the resultant of two “sufficiently generic” bivariate polynomials over a finite field can be computed in quasi-linear time.

Authors: Joris van der Hoeven, Grégoire Lecerf

Keywords: complexity, algorithm, computer algebra, resultant, elimination, multipoint evaluation

View: Html, TeXmacs, Pdf, BibTeX