SubjectsSubjects(version: 845)
Course, academic year 2018/2019
   Login via CAS
Numerical Algorithms - NMMB402
Title in English: Číselné algoritmy
Guaranteed by: Department of Algebra (32-KA)
Faculty: Faculty of Mathematics and Physics
Actual: from 2018 to 2019
Semester: summer
E-Credits: 6
Hours per week, examination: summer s.:3/1 C+Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: taught
Language: English, Czech
Teaching methods: full-time
Guarantor: doc. Mgr. Pavel Příhoda, Ph.D.
Class: M Mgr. MMIB
M Mgr. MMIB > Povinně volitelné
Classification: Mathematics > Algebra
Incompatibility : NMIB014
Interchangeability : NMIB014
Annotation -
Last update: doc. Mgr. Petr Kaplický, Ph.D. (07.01.2019)
A course on recent advanced methods of factorization. Details are given to such an extent that it enables the student to implement these algorithms. Concentration is focused on methods based on sieves in number fields.
Course completion requirements - Czech
Last update: doc. Mgr. Pavel Příhoda, Ph.D. (12.10.2017)

V průběhu semestru zadám několik domácích úkolů (asi 8). K získání zápočtu jich bude třeba vypracovat alespoň 5.

Literature -
Last update: T_KA (14.05.2013)

Cohen: A course in computational algebraic number theory, Springer-Verlag 1993.

Requirements to the exam - Czech
Last update: doc. Mgr. Pavel Příhoda, Ph.D. (12.10.2017)

Zkouška je ústní, sestává se ze tří otázek. Dvě z nich jsou teoretického charakteru a jedna spíše početní.

Syllabus -
Last update: doc. Mgr. Petr Kaplický, Ph.D. (07.01.2019)

Method based on continuous fractions as the first subexponential factorization method. Basic idea of quadratic sieve and its improvement by parallel use of more polynomials. Generalizations to sieves in number fields. Outline of methods based on elliptic curves.

Charles University | Information system of Charles University |