Leitung

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

Peter Bürgisser and Felipe Cucker and Martin Lotz (2006). General formulas for the smoothed analysis of condition numbers. C. R. Acad. Sci. Paris, 145-150.

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

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

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

Peter Bürgisser (2006). Average volume, curvatures, and Euler characteristic of random real algebraic varieties.

Peter Bürgisser and Felipe Cucker and Paulin Jacobé de Naurois (2005). The complexity of semilinear problems in succinct representation. Proceedings of 15th International Symposium on Fundamentals of Computation Theory. Springer, 479-490.

Peter Bürgisser and Felipe Cucker and Martin Lotz (2005). Counting Complexity Classes for Numeric Computations III: Complex Projective Sets. Foundations of Computational Mathematics, 351-387.

Peter Bürgisser and Felipe Cucker and Martin Lotz (2004). The Complexity to Compute the Euler Characteristic of Complex Varieties. C. R. Acad. Sci. Paris, 371-376.

Peter Bürgisser (2004). The Complexity of Factors of Multivariate Polynomials. Foundations of Computational Mathematics, 369-396.

Peter Bürgisser and Martin Lotz (2004). Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. Journal of the ACM, 464-482.

Peter Bürgisser and Felipe Cucker (2004). Counting Complexity Classes for Numeric Computations II: Algebraic and Semialgebraic Sets. In Proceedings of 36th STOC, 475-485.

Peter Bürgisser and Felipe Cucker (2003). Counting Complexity Classes for Numeric Computations I: Semilinear Sets. SIAM J. Comp., 227-260.

Peter Bürgisser and Felipe Cucker (2003). Counting Complexity Classes over the Reals I: The Additive Case. In Proceedings of ISAAC 2003. Springer, 625-634.

Peter Bürgisser and Martin Lotz (2002). Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. In Proceedings of 43rd FOCS, 658-668.