# Which algorithm is used for computing the gcd of sparse polynomial

There are lot of algorithms that compute the gcd of the polynomial for handling different cases Is there any fast algorithm that computes the gcd of polynomial faster, also wants to know which algorithm does sage math used for computing the gcd of sparse polynomial