aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano.tronto@gmail.com>2019-09-20 11:57:37 +0200
committerSebastiano Tronto <sebastiano.tronto@gmail.com>2019-09-20 11:57:37 +0200
commit4667f58199102f43bb2be1772c0ced030b5aaa61 (patch)
tree7857f9d4376e5d28f4baedfb2a16f906879b58ce /README.md
parenta5f9ce11f6e42b0d636b0b9cc2b14e069c7fc2d9 (diff)
downloadkummer-degrees-4667f58199102f43bb2be1772c0ced030b5aaa61.tar.gz
kummer-degrees-4667f58199102f43bb2be1772c0ced030b5aaa61.zip
New documentation
Diffstat (limited to '')
-rw-r--r--README.md3
1 files changed, 1 insertions, 2 deletions
diff --git a/README.md b/README.md
index 00c8634..203599c 100644
--- a/README.md
+++ b/README.md
@@ -36,8 +36,7 @@ generators can slow the script as well.
36* The code is very fast for groups of small rank (e.g. up to 5) and generated 36* The code is very fast for groups of small rank (e.g. up to 5) and generated
37by elements of magnitude 10^6; higher ranks are feasible as well with smaller 37by elements of magnitude 10^6; higher ranks are feasible as well with smaller
38generators. 38generators.
39* The complexity of the calculation of a call of KummerDegree(G,M,N) does not 39* The complexity of KummerDegree(G,M,N) does not depend on M and N.
40depend on M and N.
41 40
42Moreover, the results for each group G are cached, so that subsequent 41Moreover, the results for each group G are cached, so that subsequent
43computation of degrees for the same group G only require constant time 42computation of degrees for the same group G only require constant time

Generated with cgit - Back to sebastiano.tronto.net