### Page Content

### to Navigation

# 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**.

Type | Weekday | Duration | Location | Teacher |
---|---|---|---|---|

Lecture | Tuesday | 08^{15}-09^{45} | MA 313 | Prof. Dr. Peter Bürgisser |

Exercise | Wednesday | 10^{15}-11^{45} | MA 313 | Jesko Hüttenhain |

Teacher | Weekday | Time |
---|---|---|

Prof. Dr. Peter Bürgisser | Wednesday | 14^{30}-16^{00} |

Jesko Hüttenhain | Wednesday | 14^{00}-15^{30} |