Leitung

Eric Allender and Peter Bürgisser and Johan Kjeldgaard-Pedersen and Peter Bro Miltersen - On the Complexity of Numerical Analysis [12]. SIAM J. Comput. 38(5) pp. 1987-2006, 2009.

Peter Bürgisser and Joachim von zur Gathen and Oded Goldreich and Madhu Sudan - Oberwolfach Report No. 52/2009 on "Complexity Theory" [13]. Oberwolfach Reports 6(4) pp. 2787-2850, European Mathematical Society, 2009.

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

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

Peter Bürgisser and Felipe Cucker and Martin Lotz - The probability that a slightly perturbed numerical analysis problem is difficult [16]. Math. Comp. 77 pp. 1559-1583, 2008.

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

Peter Bürgisser and Peter Scheiblechner - Differential Forms in Computational Algebraic Geometry [18]. Proc. of ISSAC pp. 61-68, Waterloo, Canada, 2007.

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

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

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

Eric Allender and Peter Bürgisser and Johan Kjeldgaard-Pedersen and Peter Bro Miltersen - On the Complexity of Numerical Analysis (Conference Version) [22]. In Proc. of 21st Ann. IEEE Conference on Computational Complexity pp. 331-339, Prague, 2006.

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

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

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

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