scholarly journals Two efficient algorithms for arithmetic of elliptic curves using Frobenius map

Author(s):  
Jung Hee Cheon ◽  
Sungmo Park ◽  
Sangwoo Park ◽  
Daeho Kim
2014 ◽  
Vol 20 (1) ◽  
pp. 340-343 ◽  
Author(s):  
Intan Muchtadi-Alamsyah ◽  
Tomy Ardiansyah ◽  
Sa'aadah Sajjana Carita

Author(s):  
Henry McKean ◽  
Victor Moll
Keyword(s):  

2018 ◽  
Vol 12 ◽  
pp. 25-41
Author(s):  
Matthew C. FONTAINE

Among the most interesting problems in competitive programming involve maximum flows. However, efficient algorithms for solving these problems are often difficult for students to understand at an intuitive level. One reason for this difficulty may be a lack of suitable metaphors relating these algorithms to concepts that the students already understand. This paper introduces a novel maximum flow algorithm, Tidal Flow, that is designed to be intuitive to undergraduate andpre-university computer science students.


2004 ◽  
Vol 9 (4) ◽  
pp. 331-348
Author(s):  
V. Garbaliauskienė

A joint universality theorem in the Voronin sense for L-functions of elliptic curves over the field of rational numbers is proved.


Author(s):  
Toshihiro AKAGI ◽  
Tetsuya ARAKI ◽  
Shin-ichi NAKANO

Sign in / Sign up

Export Citation Format

Share Document