On the Computational Complexity of Modular Symbols (Q4024693): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
label / en | label / en | ||
On the Computational Complexity of Modular Symbols | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.2307/2153219 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4240274310 / rank | |||
Normal rank | |||
Property / title | |||
On the Computational Complexity of Modular Symbols (English) | |||
Property / title: On the Computational Complexity of Modular Symbols (English) / rank | |||
Normal rank |
Revision as of 03:23, 20 March 2024
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