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 >> [11]

Peter Bürgisser - Average volume, curvatures, and Euler characteristic of random real algebraic varieties [12], Preprint 2006.


Peter Bürgisser and Felipe Cucker and Paulin Jacobé de Naurois - The complexity of semilinear problems in succinct representation [13]. Proceedings of 15th International Symposium on Fundamentals of Computation Theory Lecture Notes in Computer Science (3623) pp. 479-490, . Springer, Lübeck, August 17-20/ 2005.


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


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


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


Peter Bürgisser and Martin Lotz - Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps [17]. Journal of the ACM 51(3) pp. 464-482, 2004.


Peter Bürgisser and Felipe Cucker - Counting Complexity Classes for Numeric Computations II: Algebraic and Semialgebraic Sets [18]. In Proceedings of 36th STOC pp. 475-485, Chicago, 2004.


Peter Bürgisser and Felipe Cucker - Counting Complexity Classes for Numeric Computations I: Semilinear Sets [19]. SIAM J. Comp. 33(1) pp. 227-260, 2003.


Peter Bürgisser and Felipe Cucker - Counting Complexity Classes over the Reals I: The Additive Case [20]. In Proceedings of ISAAC 2003 Lecture Notes in Computer Science (2906) pp. 625-634, . Springer, 2003.


Peter Bürgisser and Martin Lotz - Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps [21]. In Proceedings of 43rd FOCS pp. 658-668, Vancouver, November 16-19/ 2002.


Peter Bürgisser - The Complexity of Factors of Multivariate Polynomials [22]. Proceedings 42nd FOCS pp. 378-385, Las Vegas, October 14-17/ 2001.


Peter Bürgisser and Alexandre Kurth and Armin Wagner - Incorporating Severity Variations into Credit Risk [23]. Journal of Risk 3(4) pp. 5-31, 2001.


Peter Bürgisser - On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity [24]. Proc. 26th Symposium on Mathematical Foundations of Computer Science Lecture Notes in Computer Science (2136) pp. 3-17, . Springer Verlag, Marianske Lazne, 2001.


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


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


<< zurück [27]
vor >> [34]
------ Links: ------

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

Diese Seite verwendet Matomo für anonymisierte Webanalysen. Mehr Informationen und Opt-Out-Möglichkeiten unter Datenschutz.
Copyright TU Berlin 2008