Subjects

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

Algorithms on Polynomials - NMMB413

Title:	Algoritmy na polynomech
Guaranteed by:	Department of Algebra (32-KA)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2025
Semester:	winter
E-Credits:	4
Hours per week, examination:	winter s.:2/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

Guarantor:	doc. Mgr. Pavel Příhoda, Ph.D.
Teacher(s):	Bc. Martin Borýsek doc. Mgr. Pavel Příhoda, Ph.D.
Class:	M Mgr. MMIB M Mgr. MMIB > Povinné M Mgr. MSTR M Mgr. MSTR > Povinně volitelné
Classification:	Mathematics > Algebra
Is interchangeable with:	NMMB403

Annotation - Czech

Přednáška prezentuje základní algoritmy pro práci s polynomy jedné a více neurčitých.

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

Course completion requirements -

The course is finished by getting credits from problem sessions and by passing an exam.

The credit is awarded for gaining enough points from two homeworks, the exam is oral with 3 questions from the course.

Last update: Příhoda Pavel, doc. Mgr., Ph.D. (30.09.2025)

Literature -

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

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

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

Syllabus -

Gröbnerovy báze.

Aplikace Gröbnerových bází v algebraické geometrii.

Rozklady polynomů (celočíselných i nad konečnými tělesy).

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