From 3ecf27ba624c886f993678fd323fd2f010062672 Mon Sep 17 00:00:00 2001
From: couturie <couturie@extinction>
Date: Fri, 6 Nov 2015 16:19:03 +0100
Subject: [PATCH] new

---
 paper.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/paper.tex b/paper.tex
index 44f01e2..ba1e7ee 100644
--- 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}
-- 
2.39.5