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 Christian Ikenmeyer (2008). The Complexity of Computing Kronecker Coefficients [11]. FPSAC 2008, 357-368.


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


Peter Bürgisser (2007). Average Euler Characteristic of Random Real Algebraic Varieties [13]. 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 [14]. Foundations of Computational Mathematics, 51-86.


Peter Bürgisser and Felipe Cucker (2007). Exotic quantifiers, complexity classes, and complete problems [15]. 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) [16]. In Proc. of 21st Ann. IEEE Conference on Computational Complexity, 331-339.


Peter Bürgisser and Felipe Cucker and Martin Lotz (2006). General formulas for the smoothed analysis of condition numbers [17]. C. R. Acad. Sci. Paris, 145-150.


Peter Bürgisser and Felipe Cucker and Martin Lotz (2006). Smoothed analysis of complex conic condition numbers [18]. Journal de Mathématiques Pures et Appliquées, 293-309.


Peter Bürgisser and Felipe Cucker and Paulin Jacobé de Naurois (2006). The complexity of semilinear problems in succinct representation [19]. Computational Complexity, 197-235.


Peter Bürgisser and Felipe Cucker (2006). Counting Complexity Classes for Numeric Computations II: Algebraic and Semialgebraic Sets [20]. Journal of Complexity, 147-191.


Peter Bürgisser (2006). Average volume, curvatures, and Euler characteristic of random real algebraic varieties [21].


Peter Bürgisser and Felipe Cucker and Paulin Jacobé de Naurois (2005). The complexity of semilinear problems in succinct representation [22]. Proceedings of 15th International Symposium on Fundamentals of Computation Theory. Springer, 479-490.


Peter Bürgisser and Felipe Cucker and Martin Lotz (2005). Counting Complexity Classes for Numeric Computations III: Complex Projective Sets [23]. Foundations of Computational Mathematics, 351-387.


Peter Bürgisser and Felipe Cucker and Martin Lotz (2004). The Complexity to Compute the Euler Characteristic of Complex Varieties [24]. C. R. Acad. Sci. Paris, 371-376.


Peter Bürgisser (2004). The Complexity of Factors of Multivariate Polynomials [25]. Foundations of Computational Mathematics, 369-396.


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

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008