direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Algorithmic Algebra

While pure algebra is mainly concerned with analyzing the structure of abstract objects, algorithmic algebra deals with questions of constructiveness and effectivity. Problems that appear simple from the structural point of view, suddenly become extremely challenging! A famous example for this phenomenon is the problem of primality testing and factoring integers.

The goal of the lecture is to introduce students to some methods and results in this area. This course complements my lectures on (structural) Algebra I and Algebra II at TU Berlin. Basic knowledge of algebra should be sufficient to follow the course. 

Recent Updates

Thursday, 26. June 2014

  • The page was made bilingual and contains information about the oral exams.
  • Note that the start date for the course is tuesday, 22nd of April.
  • The prospective contents of the course have been published.

Oral Exams

The oral exams will take place in the period from Monday 8/11/2014 to Saturday 8/16/2014. For more information, please refer to the German version of the page or contact Jesko.

Schedules

The lectures start on tuesday, the 22nd of April.

Course Hours
Type
Weekday
Duration
Location
Teacher
Lecture
Tuesday
0815-0945
MA 313
Prof. Dr. Peter Bürgisser
Exercise
Wednesday
1015-1145
MA 313
Jesko Hüttenhain
Consulation Hours
Teacher
Weekday
Time
Prof. Dr. Peter Bürgisser
Wednesday
1430-1600
Jesko Hüttenhain
Wednesday
1400-1530

Prospective contents

  • Discrete and fast Fourier transform, rapid multiplication and division of polynomials
  • Euclidean algorithm and some of its applications
  • Factoring polynomials of finite fields
  • Efficient primality testing

Literature

  • Joachim von zur Gathen, Gerhard: Modern Computer Algebra, Cambridge University Press, second edition, 2003
  • Mignotte: Mathematics for computer algebra, Springer, 1992
  • C.K. Yap: Fundamental Problems of Algorithmic Algebra, Oxford University Press, 2000

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions