Leitung

Peter Bürgisser and Peter Scheiblechner - On the Complexity of Counting Components of Algebraic Varieties [12]. Journal of Symbolic Computation 44(9) pp. 1114-1136, 2009.

Peter Bürgisser - On defining integers and proving arithmetic circuit lower bounds [13]. Computational Complexity 18 pp. 81-103, 2009.

Peter Bürgisser and Felipe Cucker - Exotic quantifiers, complexity classes, and complete problems [14]. Foundations of Computational Mathematics 9(2) pp. 135-170, 2009.

Eric Allender and Peter Bürgisser and Johan Kjeldgaard-Pedersen and Peter Bro Miltersen - On the Complexity of Numerical Analysis [15]. 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" [16]. 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 [17]. FPSAC 2009 DMTCS proc. AK pp. 267-278, Hagenberg, Austria, 2009.

Peter Bürgisser - Smoothed Analysis of Condition Numbers [18]. 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 [19]. Math. Comp. 77 pp. 1559-1583, 2008.

Peter Bürgisser and Christian Ikenmeyer - The Complexity of Computing Kronecker Coefficients [20]. 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 [21]. Proc. of ISSAC pp. 61-68, Waterloo, Canada, 2007.

Peter Bürgisser - Average Euler Characteristic of Random Real Algebraic Varieties [22]. 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 [23]. Foundations of Computational Mathematics 7(1) pp. 51-86, 2007.

Peter Bürgisser and Felipe Cucker - Exotic quantifiers, complexity classes, and complete problems [24]. 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) [25]. 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 [26]. C. R. Acad. Sci. Paris Ser. I 343(2) pp. 145-150, 2006.