diff options
| author | Sebastiano Tronto <sebastiano.tronto@gmail.com> | 2019-09-20 11:57:37 +0200 |
|---|---|---|
| committer | Sebastiano Tronto <sebastiano.tronto@gmail.com> | 2019-09-20 11:57:37 +0200 |
| commit | 4667f58199102f43bb2be1772c0ced030b5aaa61 (patch) | |
| tree | 7857f9d4376e5d28f4baedfb2a16f906879b58ce | |
| parent | a5f9ce11f6e42b0d636b0b9cc2b14e069c7fc2d9 (diff) | |
| download | kummer-degrees-4667f58199102f43bb2be1772c0ced030b5aaa61.tar.gz kummer-degrees-4667f58199102f43bb2be1772c0ced030b5aaa61.zip | |
New documentation
| -rw-r--r-- | README.md | 3 |
1 files changed, 1 insertions, 2 deletions
| @@ -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 |
| 37 | by elements of magnitude 10^6; higher ranks are feasible as well with smaller | 37 | by elements of magnitude 10^6; higher ranks are feasible as well with smaller |
| 38 | generators. | 38 | generators. |
| 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. |
| 40 | depend on M and N. | ||
| 41 | 40 | ||
| 42 | Moreover, the results for each group G are cached, so that subsequent | 41 | Moreover, the results for each group G are cached, so that subsequent |
| 43 | computation of degrees for the same group G only require constant time | 42 | computation of degrees for the same group G only require constant time |