diff options
| author | Sebastiano Tronto <sebastiano.tronto@gmail.com> | 2019-09-20 11:56:52 +0200 |
|---|---|---|
| committer | Sebastiano Tronto <sebastiano.tronto@gmail.com> | 2019-09-20 11:56:52 +0200 |
| commit | a5f9ce11f6e42b0d636b0b9cc2b14e069c7fc2d9 (patch) | |
| tree | 6bf9724f8cd35b43dbca5b9b56053269e8edc152 /README.md | |
| parent | 47226efb9294adfdfdc11080ac3b3b8cef06daf7 (diff) | |
| download | kummer-degrees-a5f9ce11f6e42b0d636b0b9cc2b14e069c7fc2d9.tar.gz kummer-degrees-a5f9ce11f6e42b0d636b0b9cc2b14e069c7fc2d9.zip | |
New documentation
Diffstat (limited to 'README.md')
| -rw-r--r-- | README.md | 4 |
1 files changed, 2 insertions, 2 deletions
| @@ -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. |