On the Computational Complexity of Modular Symbols (Q4024693)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Computational Complexity of Modular Symbols |
scientific article; zbMATH DE number 118410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Computational Complexity of Modular Symbols |
scientific article; zbMATH DE number 118410 |
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
0.8320425748825073
0 references
0.8049827814102173
0 references
0.7992615699768066
0 references
0.7974737286567688
0 references
