new

[kahina_paper1.git] / paper.tex

diff --git a/paper.tex b/paper.tex
index 44f01e2b82c98e41186e7f2e38055ab82dbc099d..ba1e7ee7039c62e9447b668eabdce3610a896c78 100644 (file)
--- a/paper.tex
+++ b/paper.tex
@@ -88,7 +88,7 @@ the results of a parallel implementation of the Ehrlich-Aberth
 algorithm for the root finding problem for high degree polynomials on
 GPU architectures. The main result of this
 work is to be able to solve high degree polynomials (up
-to 1,000,000) very efficiently. We also compare the results with a
+to 1,000,000)  efficiently. We also compare the results with a
 sequential implementation and the Durand-Kerner method on full and
 sparse polynomials.
 \end{abstract}