Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Numerical Algorithms - NMMB402

Title:	Číselné algoritmy
Guaranteed by:	Department of Algebra (32-KA)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2013 to 2017
Semester:	summer
E-Credits:	6
Hours per week, examination:	summer s.:3/1, C+Ex [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	Czech
Teaching methods:	full-time
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
Is interchangeable with:	NMIB014

Opinion survey results Examination dates Schedule Noticeboard

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.

Literature -

Last update: T_KA (14.05.2013)

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

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.