THIS SITE

Information for

Master’s Thesis Presentation • Scientific Computation — Fast Algorithms for Finding the Characteristic Polynomial of a Rank 2 Drinfeld ModuleExport this event to calendar

Friday, September 14, 2018 — 1:00 PM EDT

Yossef Musleh, Master’s candidate
David R. Cheriton School of Computer Science

We introduce a Monte Carlo randomized algorithm for computing the characteristic polynomial of a rank 2 Drinfeld module than runs in $O(n^2 \log n \log \log n \log q)$ field operations. We also introduce a deterministic algorithm that runs in $O(n^{2.6258} \log n + n^2 \log n \log log n \log q)$ field operations. Both approaches are a significant improvement over the current literature.

Location 
DC - William G. Davis Computer Research Centre
2310
200 University Avenue West
Waterloo, ON N2L 3G1
Canada

S M T W T F S
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
  1. 2018 (198)
    1. December (1)
    2. November (11)
    3. October (26)
    4. September (23)
    5. August (17)
    6. July (20)
    7. June (13)
    8. May (25)
    9. April (34)
    10. March (24)
    11. February (3)
    12. January (1)
  2. 2017 (37)
    1. December (2)
    2. November (5)
    3. October (3)
    4. September (4)
    5. July (4)
    6. June (3)
    7. May (2)
    8. April (2)
    9. March (6)
    10. February (4)
    11. January (2)
  3. 2016 (21)
  4. 2015 (36)
  5. 2014 (33)
  6. 2013 (23)
  7. 2012 (4)
  8. 2011 (1)
  9. 2010 (1)
  10. 2009 (1)
  11. 2008 (1)