direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

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: Mittwochs 1200-1300.
Während der vorlesungsfreien Zeit: Nach Vereinbarung.

Publikationen

Peter Bürgisser and Felipe Cucker and Martin Lotz (2010). Coverage Processes on Spheres and Condition Numbers for Linear Programming. The Annals of Probability, 570-604.


Peter Bürgisser and Peter Scheiblechner (2009). On the Complexity of Counting Components of Algebraic Varieties. Journal of Symbolic Computation, 1114-1136.


Peter Bürgisser (2009). On defining integers and proving arithmetic circuit lower bounds. Computational Complexity, 81-103.


Peter Bürgisser and Felipe Cucker (2009). Exotic quantifiers, complexity classes, and complete problems. Foundations of Computational Mathematics, 135-170.


Eric Allender and Peter Bürgisser and Johan Kjeldgaard-Pedersen and Peter Bro Miltersen (2009). On the Complexity of Numerical Analysis. SIAM J. Comput., 1987-2006.


Peter Bürgisser and Joachim von zur Gathen and Oded Goldreich and Madhu Sudan (2009). Oberwolfach Report No. 52/2009 on "Complexity Theory". European Mathematical Society, 2787-2850.


Peter Bürgisser and Christian Ikenmeyer (2009). A max-flow algorithm for positivity of Littlewood-Richardson coefficients. FPSAC 2009, 267-278.


Peter Bürgisser (2009). Smoothed Analysis of Condition Numbers. Foundations of Computational Mathematics. Cambridge University Press, 1- 41.


Peter Bürgisser and Felipe Cucker and Martin Lotz (2008). The probability that a slightly perturbed numerical analysis problem is difficult. Math. Comp., 1559-1583.


Peter Bürgisser and Christian Ikenmeyer (2008). The Complexity of Computing Kronecker Coefficients. FPSAC 2008, 357-368.


Peter Bürgisser and Peter Scheiblechner (2007). Differential Forms in Computational Algebraic Geometry. Proc. of ISSAC, 61-68.


Peter Bürgisser (2007). Average Euler Characteristic of Random Real Algebraic Varieties. Comptes Rendus - Mathematique, 507-512.


Peter Bürgisser and Martin Lotz (2007). The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties. Foundations of Computational Mathematics, 51-86.


Peter Bürgisser and Felipe Cucker (2007). Exotic quantifiers, complexity classes, and complete problems. Proc. of ICALP 2007, 207-218.


Eric Allender and Peter Bürgisser and Johan Kjeldgaard-Pedersen and Peter Bro Miltersen (2006). On the Complexity of Numerical Analysis (Conference Version). In Proc. of 21st Ann. IEEE Conference on Computational Complexity, 331-339.


Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe