Peter Bürgisser

Prof. Dr. Peter Bürgisser is a Professor at the Technical University of Berlin, affiliated with the Institute of Mathematics and the Algorithmic Algebra research group within Faculty II - Mathematics and Natural Sciences. His research focuses on algebraic complexity theory, computational algebra, and geometric methods in computer science. Bürgisser has made significant contributions to topics including invariant theory, numerical analysis of algorithms, and the computational complexity of algebraic problems. He has authored influential books such as *Algebraic Complexity Theory* and has published extensively in top-tier journals like the Journal of the ACM and SIAM Journal on Computing.

His work includes developing polynomial-time algorithms for problems in invariant theory, analyzing the condition numbers of algebraic varieties, and studying the computational aspects of semialgebraic sets. Bürgisser's research also intersects with probability theory, particularly in understanding the statistical properties of zeros of random polynomials and the geometry of random algebraic varieties.

Recent trends in his publications emphasize geometric complexity theory, non-commutative optimization, and the application of numerical methods to algebraic problems. He has collaborated with researchers such as Felipe Cucker, Michael Walter, and Avi Wigderson on foundational topics in computational mathematics and theoretical computer science.

Bürgisser's office is located in room EB 116, and his contact information includes the email pbuerg@math.tu-berlin.de. His research has been supported through grants and collaborations, though specific grant details are not explicitly mentioned in the provided texts.