## Computer Science Department - Technische Universität München## Chair for Efficient Algorithms |

**Lecturer:**

Prof. Dr. Ernst W. Mayr

Dr. Peter Ullrich**Area:**

4 lectures per week in area III (Theoretical Computer Science)

advanced course, topic algorithms**Time and Place:**

Wed 12:15 - 13:45, lecture hall MI 00.04.011

Fri 08:30 - 10:00, lecture hall MI 00.04.011-
**Exercises:**

2 hours per week central exercises accompanying the lectures

Mon 08:30 - 10:00, lecture hall 00.07.011

Beginning: Apr 18, 2005

*Teaching Assistant:*Dmytro Chibisov

*Course Certificate:*To get a course certificate students must to be announced **Audience:**

graduate students of computer science or mathematics

students with computer science as minor**Prerequisites:**

1st and 2nd year courses**Recommended for:**

In-depth knowledge in topic Algorithms**Contents:**

Foundations of algebra und algebraic geometry, Gröbner bases, Buchberger's algorithm,

solving systems of polynomial equations, classical elimination theory, complexity.

**Related and Advanced Lectures:**

Computational Algebra II**Lecture Notes:**

Not available.**References:**

Cox, Little, O'Shea:*Ideals, Varieties and Algorithms*, Springer-Verlag,

Becker, Weispfenning:*Gröbner Bases*, GTM 141, Srpinger-Verlag,

Kreuzer, Robbiano:*Computational Commutative Algebra 1*, Srpinger-Verlag,

Mishra:*Algorithmic Algebra*, Springer-Verlag,

Greuel, Pfister:*A Singular Introduction to Commutative Algebra,*Springer-Verlag.**Office Hours:**

look here

Last Changes: Peter Ullrich on 11/04/2005 |