Leitung

Peter Bürgisser and Ankit Garg and Rafael Oliveira and Michael Walter and Avi Wigderson (2018). Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory [10]. 9th Innovations in Theoretical Computer Science, 24:1–24:20.

Bürgisser, Peter and Cucker, Felipe and Tonelli-Cueto, Josué (2018). Computing the Homology of Semialgebraic Sets I: Lax Formulas [11].

Iréné Briquel and Peter Bürgisser (2018). The real tau-conjecture is true on average [12].

Diego Armentano and Carlos Beltrán and Peter Bürgisser and Felipe Cucker and Michael Shub (2018). A stable, polynomial-time algorithm for the eigenpair problem [13]. Journal of the European Mathematical Society (JEMS), 1375–1437.

Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Oliveira, Michael Walter, Avi Wigderson (2018). Efficient algorithms for tensor scaling, quantum marginals and moment polytopes [14].

Peter Bürgisser and Felipe Cucker and Elisa Rocha Cardozo (2017). On the condition of the zeros of characteristic polynomials [15]. J. Complexity, 72–84.

Felipe Cucker and Peter Bürgisser and Pierre Lairez (2017). Computing the homology of basic semialgebraic sets in weak exponential time [16].

Peter Bürgisser and Matthias Christandl and Ketan D. Mulmuley and Michael Walter (2017). Membership in moment polytopes is in NP and coNP [17]. SIAM Journal on Computing, 972-991.

Peter Bürgisser and Christian Ikenmeyer (2017). Fundamental invariants of orbit closures [18]. Journal of Algebra, 390–434.

Peter Bürgisser and Antonio Lerario (2016). Probabilistic Schubert Calculus [19].

Peter Bürgisser and Christian Ikenmeyer and Jesko Hüttenhain (2016). Permanent Versus Determinant: Not Via Saturations [20]. Proc. AMS, 1247-1258.

Peter Bürgisser (2016). Permanent versus determinant, obstructions, and Kronecker coefficients [21]. Séminaire Lotharingien de Combinatoire

Paul Breiding and Peter Bürgisser (2016). Distribution of the eigenvalues of a random system of homogeneous polynomials [22]. Linear Algebra and its Applications, 88-107.

Peter Bürgisser and Christian Ikenmeyer and Greta Panova (2016). No occurrence obstructions in geometric complexity theory [23]. Proceedings 57th Annual IEEE Symposium on Foundations of Computer Science, 386–395.

Peter Bürgisser and Kathlén Kohn and Pierre Lairez and Bernd Sturmfels (2016). Computing the Chow variety of quadratic space curves [24]. Mathematical Aspects of Computer and Information Sciences (eds. I. Kotsireas, S. Rump and C. Yap) - MACIS 2015, Berlin, Germany, November 11-13, Revised Selected Papers, 130-136.