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

Computational Algebra II (SS 03)

• 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:
  Mo 10:15 - 11:45, MI 00.09.022
  Di 10:05 - 11:35, MW0250 (Maschinenwesen)

• Exercises:
  2 hours per week central exercises accompanying the lectures
  Mo 14:15-15:45, MI 03.11.011B
  Teaching Assistant: Thomas Bayer
  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.
  Knowledge of ''Computational Algebra I (WS02/03)'' would be helpful (or e.g. chap.1-3 in [CLO]).
  In the first lesson, however, I will give a brief summary of the main results of part I.

• Recommended for:
  In-depth knowledge in topic Algorithms

• Contents:
  

• Related and Advanced Lectures:
  Computational Algebra I

• Lecture Notes:
  Not available.

• References:
  [CLO] Cox, Little, O'Shea: Ideals, Varieties and Algorithms, Springer Verlag
  Mishra: Algorithmic Algebra, Springer Verlag
  Greuel, Pfister: A Singular Introduction to Commutative Algebra, Springer Verlag
  Becker, Weispfenning: Gröbner Bases, GTM 141, Springer Verlag
  Kreuzer, Robbiano: Computational Commutative Algebra 1, Springer Verlag
  Cox, Little, O'Shea: Using Algebraic Geometry, GTM 185, Springer Verlag
  Winkler: Polynomial Algotithms in Computer Algebra, Springer Verlag

• Office Hours:
  look here