\label{fig:04}
\end{figure}
+\begin{figure}[htbp]
+\centering
+ \includegraphics[width=0.8\textwidth]{figures/EA_DK1}
+\caption{Execution times of the Durand-Kerner and the Ehrlich-Aberth methods on GPU}
+\label{fig:0}
+\end{figure}
+
Figure~\ref{fig:04} shows the execution times of both methods with
sparse polynomial degrees ranging from 1,000 to 1,000,000. We can see
that the Ehrlich-Aberth algorithm is faster than Durand-Kerner
