On the Computational Complexity of Modular Symbols (Q4024693)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Computational Complexity of Modular Symbols |
scientific article |
Statements
10 February 1993
0 references
geodesic lines
0 references
polynomial time algorithms
0 references
period integrals
0 references
fast algorithms
0 references
computation of modular symbols
0 references
On the Computational Complexity of Modular Symbols (English)
0 references
