direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Leitung

Prof. Dr. Peter Bürgisser

Lupe [1]

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 [2]
Raum MA 318
Tel.: +49 (0)30 314 - 25771

eMail
peter.buergisser@offmath.tu-berlin.de
contact form [3]

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

<< zurück [4]
vor >> [10]

Peter Bürgisser and Matthias Christandl and Christian Ikenmeyer (2011). Nonvanishing of Kronecker coefficients for rectangular shapes [11]. Advances in Mathematics, 2082-2091.


Peter Bürgisser and Joseph Montague Landsberg and Laurent Manivel and Jerzy Weyman (2011). An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP [12]. SIAM J. Comput., 1179-1209.


Peter Bürgisser (2010). Smoothed analysis of condition numbers [13]. Proceedings of the International Congress of Mathematicians. Hindustan Book Agency, 2609-2633.


Peter Bürgisser and Felipe Cucker (2010). Smoothed Analysis of Moore-Penrose Inversion [14]. SIAM J. Matrix Anal. & Appl., 2769-2783.


Peter Bürgisser and Felipe Cucker (2010). Solving Polynomial Equations in Smoothed Polynomial Time and a Near Solution to Smale's 17th Problem [15]. In Proceedings STOC 2010, 503-512.


Peter Bürgisser and Peter Scheiblechner (2010). Counting Irreducible Components of Complex Algebraic Varieties [16]. Computational Complexity, 1-35.


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


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


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


Peter Bürgisser and Felipe Cucker (2009). Exotic quantifiers, complexity classes, and complete problems [20]. 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 [21]. 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" [22]. European Mathematical Society, 2787-2850.


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


Peter Bürgisser (2009). Smoothed Analysis of Condition Numbers [24]. 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 [25]. Math. Comp., 1559-1583.


<< zurück [26]
vor >> [32]
------ Links: ------

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008