direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

There is no English translation for this web page.

In Proceedings

Bürgisser, P., Gathen, J. v. z., Goldreich, O. and Sudan, M. - Oberwolfach Report No. 52/2009 on "Complexity Theory". Oberwolfach Reports 6(4) pp. 2787-2850, European Mathematical Society, 2009.

Bürgisser, P. and Ikenmeyer, C. - A max-flow algorithm for positivity of Littlewood-Richardson coefficients. FPSAC 2009 DMTCS proc. AK pp. 267-278, Hagenberg, Austria, 2009.

Bürgisser, P. - Smoothed Analysis of Condition Numbers. Foundations of Computational Mathematics London Mathematical Society Lecture Note Series (363) pp. 1- 41, . Cambridge University Press, Hong Kong, 2009.

Bürgisser, P. and Ikenmeyer, C. - The Complexity of Computing Kronecker Coefficients. FPSAC 2008 DMTCS proc. AJ pp. 357-368, Valparaiso-Viña del Mar, Chile, 2008.

Bürgisser, P. and Cucker, F. - Exotic quantifiers, complexity classes, and complete problems. Proc. of ICALP 2007 Lecture Notes in Computer Science (4596) pp. 207-218, 2007.

Allender, E., Bürgisser, P., Kjeldgaard-Pedersen, J. and Miltersen, P. B. - On the Complexity of Numerical Analysis (Conference Version). In Proc. of 21st Ann. IEEE Conference on Computational Complexity pp. 331-339, Prague, 2006.

Bürgisser, P., Cucker, F. and Naurois, P. J. d. - The complexity of semilinear problems in succinct representation. 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.

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

Bürgisser, P. and Cucker, F. - Counting Complexity Classes over the Reals I: The Additive Case. 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. In Proceedings of 43rd FOCS pp. 658-668, Vancouver, November 16-19/ 2002.

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

Bürgisser, P. - On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity. 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., Kurth, A., Wagner, A. and Wolf, M. - Credit risk: Integrating correlations. Risk Magazine 12(7) pp. 57-60, 1999.

Bürgisser, P. - The computational complexity to evaluate representations of general linear groups. 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. In Proc. 15th Symposium on Theoretical Aspects of Computer Science Lecture Notes in Computer Science (1373) pp. 194-204, . Springer Verlag, 1998.

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

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