AG von zur Gathen - Algorithmische Mathematik

Wintersemester 2002/2003

Oberseminar Algorithmische Mathematik1


Mittwoch, 16. Oktober 2002, 16:00, D3.230:
Vorbesprechung und AG-Besprechung.

Mittwoch, 30. Oktober 2002, 9:15, D3.230:
Pascal Koiran (Ecole Normale Supérieure de Lyon):
Vandermonde Matrices, NP-completeness, and Transversal Subspaces.

Donnerstag, 7. November 2002, 16:00, D3.230:
Preda Mihailescu:
Der polynomialzeit-deterministische Primheitstest von Agrawal, Kayal und Saxena (AKS).

Donnerstag, 28. November 2002, 16:00, D3.230:
 Olaf Müller, Michael Nüsken:
Never trust Victor!

Donnerstag, 19. Dezember 2002, 14:00, H5:
Andreas Meyer:
On a new approach towards complexity lower bounds by geometric invariant
theory - Part I: The stability of a semisimple algebra

Donnerstag, 9. Januar  2003, 16:00, D1.320:
Andreas Meyer:
On a new approach towards complexity lower bounds by geometric invariant
theory - Part II: The stability and semistability of a semisimple algebra

Donnerstag, 23. Januar 2003, 16:00, D3.230:
Peter Bürgisser:
Real Counting Complexity Classes and Computational Complexity of Topological Invariants.

Donnerstag, 6. Februar 2003, 16:00, D3.230:
Preda Mihailescu:
Fast AKS.

Donnerstag, 13. Februar 2003, 16:00, D3.230:
Martin Lotz:
On Raz's lower bound for matrix multiplication.
 
 
 
 


1Normalerweise findet das Oberseminar in D3.230 statt. Ausweichraum ?D1.320?.

Author: Michael Nüsken, Jamshid Shokrollahi last change:Tue 17 Dec 2002 12:53:10 PM MET