direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Search for Publication

Suche nach Publikationen




All Publications

<< zurück [1]
vor >> [11]

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


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


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


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


Bürgisser, P., Kurth, A. and Wagner, A. - Incorporating Severity Variations into Credit Risk [16]. Journal of Risk 3(4) pp. 5-31, 2001.


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


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


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


Bürgisser, P. - Cook's versus Valiant's Hypothesis [20]. Theor. Comp. Sci. 235 pp. 71-88, 2000.


Bürgisser, P. - On the structure of Valiant's complexity classes [21]. Discr. Math. Theoret. Comp. Sci. 3 pp. 73-94, 1999.


Bürgisser, P., Kurth, A., Wagner, A. and Wolf, M. - Credit risk: Integrating correlations [22]. Risk Magazine 12(7) pp. 57-60, 1999.


Bürgisser, P. - On the parallel complexity of the polynomial ideal membership problem [23]. J. Compl. 14 pp. 176-189, 1998.


Bürgisser, P. - The computational complexity to evaluate representations of general linear groups [24]. In Proc. 10th International Conference on Formal Power Series and Algebraic Combinatorics pp. 115-126, Toronto, 1998.


Bürgisser, P. - On the structure of Valiant's complexity classes [25]. In Proc. 15th Symposium on Theoretical Aspects of Computer Science Lecture Notes in Computer Science (1373) pp. 194-204, . Springer Verlag, 1998.


Bürgisser, P. - Completeness and Reduction in Algebraic Complexity Theory [26]. Habilitation, Universität Zürich 1998.


<< zurück [27]
vor >> [37]
------ 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