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

diff --git a/paper.tex b/paper.tex
index e024df9..5920cad 100644
--- a/paper.tex
+++ b/paper.tex
@@ -654,6 +654,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