TU Berlin

Fachgebiet Algorithmische AlgebraProf. Dr. Peter Bürgisser

Inhalt des Dokuments

zur Navigation

Leitung

Prof. Dr. Peter Bürgisser

Lupe

Anschrift
Technische Universität Berlin
Institut für Mathematik
Sekretariat MA 3-2
Straße des 17. Juni 136
10623 Berlin

Büro
Raum MA 317 (3. OG)
Institut für Mathematik

Kontakt

Sekretariat
Beate Nießen
Raum MA 318
Tel.: +49 (0)30 314 - 25771

eMail
peter.buergisser@offmath.tu-berlin.de

Telefon
+49 (0)30 314 - 75902
Faxgerät
+49 (0)30 314 - 25839

Sprechstunde
Während der Vorlesungszeit: Do, 15-16 Uhr.
Während der vorlesungsfreien Zeit: nach Vereinbarung.

Publikationen

Peter Bürgisser - The computational complexity to evaluate representations of general linear groups. SIAM J. Comp. 30(3) pp. 1010-1022, 2000.


Peter Bürgisser - The computational complexity of immanants. SIAM J. Comp. 30(3) pp. 1023-1040, 2000.


Peter Bürgisser - Cook's versus Valiant's Hypothesis. Theor. Comp. Sci. 235 pp. 71-88, 2000.


Peter Bürgisser - On the structure of Valiant's complexity classes. Discr. Math. Theoret. Comp. Sci. 3 pp. 73-94, 1999.


Peter Bürgisser and Alexandre Kurth and Armin Wagner and Michael Wolf - Credit risk: Integrating correlations. Risk Magazine 12(7) pp. 57-60, 1999.


Peter Bürgisser - On the parallel complexity of the polynomial ideal membership problem. J. Compl. 14 pp. 176-189, 1998.


Peter Bürgisser - The computational complexity to evaluate representations of general linear groups. In Proc. 10th International Conference on Formal Power Series and Algebraic Combinatorics pp. 115-126, Toronto, 1998.


Peter Bürgisser - On the structure of Valiant's complexity classes. In Proc. 15th Symposium on Theoretical Aspects of Computer Science Lecture Notes in Computer Science (1373) pp. 194-204, . Springer Verlag, 1998.


Peter Bürgisser - Completeness and Reduction in Algebraic Complexity Theory. Habilitation, Universität Zürich 1998.


Peter Bürgisser and Michael Hermann Clausen - Algebraische Komplexitaetstheorie I - Eine Einfuehrung. Seminaire Lotharingien de Combinatoire (B36a) pp. 1-18, 1996.


Peter Bürgisser - Algebraische Komplexitaetstheorie II - Schnelle Matrixmultiplikation und Kombinatorik. Seminaire Lotharingien de Combinatoire (B36b) pp. 1-16, 1996.


Peter Bürgisser - A note on the degeneration order of bilinear maps, Preprint 1996. (University of Zurich)


Peter Bürgisser and Marek Karpinski and Thomas Lickteig - On randomized semialgebraic decision complexity. J. Compl. 9(2) pp. 231-251, 1993.


Peter Bürgisser and Thomas Lickteig - Verification complexity of linear prime ideals. J. Pure Appl. Alg. 81 pp. 247-267, 1992.


Peter Bürgisser and Thomas Lickteig and Michael Shub - Test complexity of generic polynomials. J. Compl. 8(3) pp. 203-215, 1992.


Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe