Fast computation of generic bivariate resultants

Abstract

Abstract We prove that the resultant of two “sufficiently generic” bivariate polynomials over a\xa0finite field can be computed in quasi-linear expected time, using a randomized algorithm of Las Vegas type. A similar complexity bound is proved for the computation of the lexicographical Grobner basis for the ideal generated by the two polynomials.