TU Berlin

Fachgebiet Algorithmische AlgebraPublications

Inhalt des Dokuments

zur Navigation

Search for Publication

Suche nach Publikationen

All Publications

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., Cucker, F. and Lotz, M. - The probability that a slightly perturbed numerical analysis problem is difficult. Math. Comp. 77 pp. 1559-1583, 2008.

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 Scheiblechner, P. - Differential Forms in Computational Algebraic Geometry. Proc. of ISSAC pp. 61-68, Waterloo, Canada, 2007.

Bürgisser, P. - Average Euler Characteristic of Random Real Algebraic Varieties. Comptes Rendus - Mathematique 345(9) pp. 507-512, 2007.

Scheiblechner, P. - On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety. Journal of Complexity 23(3) pp. 359-379, 2007.

Bürgisser, P. and Lotz, M. - The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties. Foundations of Computational Mathematics 7(1) pp. 51-86, 2007.

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 Lotz, M. - General formulas for the smoothed analysis of condition numbers. C. R. Acad. Sci. Paris Ser. I 343(2) pp. 145-150, 2006.

Bürgisser, P., Cucker, F. and Lotz, M. - Smoothed analysis of complex conic condition numbers. Journal de Mathématiques Pures et Appliquées 86 pp. 293-309, 2006.

Bürgisser, P., Cucker, F. and Naurois, P. J. d. - The complexity of semilinear problems in succinct representation. Computational Complexity 15(3) pp. 197-235, 2006.

Bürgisser, P. and Cucker, F. - Counting Complexity Classes for Numeric Computations II: Algebraic and Semialgebraic Sets. Journal of Complexity 22(2) pp. 147-191, 2006.



Schnellnavigation zur Seite über Nummerneingabe