# Efficient algorithm to compute resultants of sparse polynomials?

Consider two polynomials $f,g\in\mathbb{F}_2$ of degree $O(2^n)$, with the property that they are extremely sparse (say, only $O(n)$ of the coefficients are non-zero). Is there a way to calculate their resultant that does not involve an exponential computation in $n$? The Sylvester matrix would be very structured (more than it is already), but I don't know if there are methods to exploit this structure to compute its determinant.

In a more general context, I'm using the resultant to check if $f$ and $g$ share a root. Is there another method to check this, considering the sparsity property?