direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content


Prof. Dr. Peter Bürgisser


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

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


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


+49 (0)30 314 - 75902
+49 (0)30 314 - 25839

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


Dennis Amelunxen and Peter Bürgisser - A coordinate-free condition number for convex programming. SIAM Journal on Optimization 22(3) pp. 1029-1041, 2012.

Peter Bürgisser and Dennis Amelunxen - Robust Smoothed Analysis of a Condition Number for Linear Programming. Mathematical Programming 131(1-2, Ser. A) pp. 221-251, 2012.

Peter Bürgisser and Christian Ikenmeyer - Geometric Complexity Theory and Tensor Rank. Proceedings 43rd Annual ACM Symposium on Theory of Computing 2011 pp. 509-518, 2011.

Peter Bürgisser and Matthias Christandl and Christian Ikenmeyer - Even partitions in plethysms. Journal of Algebra 328 pp. 322-329, 2011.

Peter Bürgisser and Felipe Cucker - On a Problem Posed by Steve Smale. Annals of Mathematics 174(3) pp. 1785-1836, 2011.

Peter Bürgisser and Matthias Christandl and Christian Ikenmeyer - Nonvanishing of Kronecker coefficients for rectangular shapes. Advances in Mathematics 227 pp. 2082-2091, 2011.

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

Peter Bürgisser - Smoothed analysis of condition numbers. Proceedings of the International Congress of Mathematicians IV pp. 2609-2633, . Hindustan Book Agency, New Delhi, 2010.

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

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

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

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

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

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

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

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.