X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper1.git/blobdiff_plain/d2f235fc6e093898258791917b95b135fd93215e..e48d60147ff49ec4df9948967e6f8ef7c85202e9:/paper.tex?ds=sidebyside

diff --git a/paper.tex b/paper.tex
index 7da8ca6..24a86ca 100644
--- a/paper.tex
+++ b/paper.tex
@@ -655,6 +655,16 @@ We initially carried out the convergence of Aberth algorithm with various sizes
 		
 \end{table}
 
+
+\begin{figure}[htbp]
+\centering
+  \includegraphics[width=0.8\textwidth]{figures/influence_nb_threads}
+\caption{Influence of the number of threads on the execution times of different polynomials (sparse and full)}
+\label{fig:01}
+\end{figure}
+
+
+
 \paragraph{A comparative study between Aberth and Durand-kerner algorithm}
 \begin{table}[htbp]
 	\centering