commit a5f9ce11f6e42b0d636b0b9cc2b14e069c7fc2d9
parent 47226efb9294adfdfdc11080ac3b3b8cef06daf7
Author: Sebastiano Tronto <sebastiano.tronto@gmail.com>
Date: Fri, 20 Sep 2019 11:56:52 +0200
New documentation
Diffstat:
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git 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
-say the following:
+The computational complexity of the algorithm has not been computed precisely.
+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.
