1 files changed, 2 insertions, 2 deletions
diff --git a/README.md b/README.md
index 07a9ab6..00c8634 100644
--- a/README.md
+++ b/README.md
@@ -26,8 +26,8 @@ that computes the degrees of such extensions when M and N vary.
 A preprint by A. Perucca, P. Sgobba and S. Tronto that explains how this is
 possible can be found in the docs folder.
-I have not computed accurately the complexity of the code. However, I can
+The computational complexity of the algorithm has not been computed precisely.
-say the following:
+However, we can say the following:
 * The complexity is exponential in the rank r of the group.
 * The script can become slow if the generators of the group G are n-th powers
 for very high n.

diff --git a/README.md b/README.md index 07a9ab6..00c8634 100644 --- a/README.md +++ b/README.md
@@ -26,8 +26,8 @@ that computes the degrees of such extensions when M and N vary.
26	A preprint by A. Perucca, P. Sgobba and S. Tronto that explains how this is	26	A preprint by A. Perucca, P. Sgobba and S. Tronto that explains how this is
27	possible can be found in the docs folder.	27	possible can be found in the docs folder.
28		28
29	I have not computed accurately the complexity of the code. However, I can	29	The computational complexity of the algorithm has not been computed precisely.
30	say the following:	30	However, we can say the following:
31	* The complexity is exponential in the rank r of the group.	31	* The complexity is exponential in the rank r of the group.
32	* The script can become slow if the generators of the group G are n-th powers	32	* The script can become slow if the generators of the group G are n-th powers
33	for very high n.	33	for very high n.