Algebraic complexity theory P Bürgisser, M Clausen, MA Shokrollahi Springer Science & Business Media, 2013 | 1328 | 2013 |

Algebraic complexity theory P Burgisser, M Clausen, MA Shokrollahi Springer, 1997 | 337 | 1997 |

Completeness and reduction in algebraic complexity theory P Bürgisser Springer Science & Business Media, 2013 | 270 | 2013 |

Condition: The geometry of numerical algorithms P Bürgisser, F Cucker Springer Science & Business Media, 2013 | 261 | 2013 |

On the complexity of numerical analysis E Allender, P Bürgisser, J Kjeldgaard-Pedersen, PB Miltersen SIAM Journal on Computing 38 (5), 1987-2006, 2009 | 206 | 2009 |

An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to P Bürgisser, JM Landsberg, L Manivel, J Weyman SIAM Journal on Computing 40 (4), 1179-1209, 2011 | 119 | 2011 |

On a problem posed by Steve Smale P Bürgisser, F Cucker Annals of Mathematics, 1785-1836, 2011 | 93 | 2011 |

Cook's versus Valiant's hypothesis P Bürgisser Theoretical Computer Science 235 (1), 71-88, 2000 | 73 | 2000 |

Integrating correlations P Bürgisser, A Kurth, A Wagner, M Wolf Risk 12 (7), 57-60, 1999 | 70 | 1999 |

Towards a theory of non-commutative optimization: Geodesic 1st and 2nd order methods for moment maps and polytopes P Bürgisser, C Franks, A Garg, R Oliveira, M Walter, A Wigderson 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 66 | 2019 |

Geometric complexity theory and tensor rank P Bürgisser, C Ikenmeyer Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 66 | 2011 |

The complexity of factors of multivariate polynomials P Bürgisser Foundations of Computational Mathematics 4, 369-396, 2004 | 64 | 2004 |

Incorporating severity variations into credit risk P Burgisser, A Kurth, A Wagner Journal of Risk 3, 5-32, 2001 | 62 | 2001 |

Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets P Bürgisser, F Cucker Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 61 | 2004 |

No occurrence obstructions in geometric complexity theory P Bürgisser, C Ikenmeyer, G Panova Journal of the American Mathematical Society 32 (1), 163-193, 2019 | 60 | 2019 |

Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory P Bürgisser, A Garg, R Oliveira, M Walter, A Wigderson arXiv preprint arXiv:1711.08039, 2017 | 60 | 2017 |

Completeness and reduction in algebraic complexity theory P Bürgisser University of Zurich, 1998 | 49 | 1998 |

Efficient algorithms for tensor scaling, quantum marginals, and moment polytopes P Bürgisser, C Franks, A Garg, R Oliveira, M Walter, A Wigderson 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 48 | 2018 |

The complexity of computing Kronecker coefficients P Bürgisser, C Ikenmeyer Discrete Mathematics & Theoretical Computer Science, 2008 | 48 | 2008 |

Explicit lower bounds via geometric complexity theory P Bürgisser, C Ikenmeyer Proceedings of the forty-fifth Annual ACM symposium on Theory of Computing …, 2013 | 46 | 2013 |