On the Computational Complexity of Modular Symbols (Q4024693): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
On the Computational Complexity of Modular Symbols
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Hecke operators on \(\Gamma_0(m)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3202227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5654155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the factors of the Jacobian variety of a modular function field / rank
 
Normal rank

Latest revision as of 14:38, 17 May 2024

scientific article
Language Label Description Also known as
English
On the Computational Complexity of Modular Symbols
scientific article

    Statements

    0 references
    0 references
    10 February 1993
    0 references
    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
    0 references
    On the Computational Complexity of Modular Symbols (English)
    0 references