Subjects

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

Computer Algebra 2 - NMMB403

Title:	Počítačová algebra 2
Guaranteed by:	Department of Algebra (32-KA)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2016 to 2016
Semester:	winter
E-Credits:	6
Hours per week, examination:	winter 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
Additional information:	http://www.karlin.mff.cuni.cz/~stanovsk/vyuka/palg.htm

Guarantor:	doc. Mgr. Pavel Příhoda, Ph.D.
Class:	M Mgr. MMIB M Mgr. MMIB > Povinné
Classification:	Mathematics > Algebra
Incompatibility :	NMIB103
Interchangeability :	NMIB103
Is interchangeable with:	NMIB103

Opinion survey results Examination dates Schedule Noticeboard

Annotation -

Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (23.05.2019)

The main topics of the course are two advanced algorithms: Gröbner bases and Lenstra-Lenstra-Lovasz Algorithm. Both the algorithms find many applications in computer algebra, geometry, cryptoanalysis, and in design of new cryptosystems.

Literature -

Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (06.09.2013)

F. Winkler: Polynomial Algorithms in Computer Algebra, Springer 1996.

Geddes, Czapor, Labahn: Algorithms for computer algebra, Kluwer Academic Publishers, 1992.

G. von zur Gathen: Modern computer algebra, Cambridge Univ. Press 1999.

Syllabus -

Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (13.09.2013)

1. Factorization of polynomials over finite fields, factorization of integral polynomials

2. Gröbner bases, applications, solving of systems of polynomial equation

3. Algorithm LLL, applications (factorization of polynomials over Z, cryptography).