Peter Bürgisser

发表

2 The Task of a Numerical Analyst

Peter Bro Miltersen, E. Allender, Peter Bürgisser, 2022 .

The Complexity of Immanants

Peter Bürgisser, 2000 .

Optimal Complexity Lower Bound for Polynomial Multiplication

Martin Lotz, Peter Bürgisser, 2003 .

A max-flow algorithm for positivity of Littlewood-Richardson coefficients

Peter Bürgisser, Christian Ikenmeyer, 2009 .

Real Polynomial Systems

F. Cucker, Peter Bürgisser, 2013 .

N A ] 2 3 N ov 2 01 5 On the condition of characteristic polynomials

Elisa Rocha Cardozo, F. Cucker, Peter Bürgisser, 2018 .

Uniform Smoothed Analysis of a Condition Number for Linear Programming

Dennis Amelunxen, Peter Bürgisser, 2008 .

General formulas for the smoothed analysis of condition numbers

Felipe Cucker, Peter Bürgisser, Martin Lotz, 2006 .

Average volume, curvatures, and Euler characteristic of random real algebraic varieties

Peter Bürgisser, 2006, math/0606755.

1 Smoothed Analysis of Condition Numbers

Peter Bürgisser, 2008 .

Probabilistic Schubert calculus

Peter Bürgisser, A. Lerário, 2016, 1612.06893.

The complexity of computing the Hilbert polynomial of smooth complex projective varieties

Martin Lotz, Peter Bürgisser, 2004 .

Verification complexity of linear prime ideals

Thomas Lickteig, Peter Bürgisser, 1992 .

The Complexity of Factors of Multivariate Polynomials

Peter Bürgisser, 2001, Found. Comput. Math..

No occurrence obstructions in geometric complexity theory

Peter Bürgisser, Christian Ikenmeyer, G. Panova, 2018, Journal of the American Mathematical Society.

Average euler characteristic of random real algebraic varieties

Peter Bürgisser, 2007 .

Average volume, curvatures, and Euler characteristic of random real algebraic varieties

Peter Bürgisser, 2006, math/0606755.

Valiant’s Algebraic Model of NP-Completeness

Peter Bürgisser, 2000 .

Intrinsic volumes of symmetric cones and applications in convex programming

Dennis Amelunxen, Peter Bürgisser, 2014, Mathematical Programming.

Robust smoothed analysis of a condition number for linear programming

Dennis Amelunxen, Peter Bürgisser, 2010, Mathematical Programming.

Computing the Homology of Semialgebraic Sets. I: Lax Formulas

F. Cucker, Peter Bürgisser, Josué Tonelli-Cueto, 2019, Foundations of Computational Mathematics.

Probabilistic Analysis of the Grassmann Condition Number

Dennis Amelunxen, Peter Bürgisser, 2013, Foundations of Computational Mathematics.

Polynomial time algorithms in invariant theory for torus actions

Avi Wigderson, Peter Bürgisser, Michael Walter, 2021, CCC.

Computing the Homology of Semialgebraic Sets. II: General Formulas

F. Cucker, Peter Bürgisser, Josué Tonelli-Cueto, 2021, Foundations of Computational Mathematics.

A G ] 1 D ec 2 01 5 Fundamental invariants of orbit closures

Peter Bürgisser, Christian Ikenmeyer, 2018 .

Condition Length and Complexity for the Solution of Polynomial Systems

M. Shub, F. Cucker, C. Beltrán, 2016, Foundations of Computational Mathematics.

Algebraic complexity theory

Michael Clausen, Peter Bürgisser, Amin Shokrollahi, 1997, Grundlehren der mathematischen Wissenschaften.

Condition - The Geometry of Numerical Algorithms

Felipe Cucker, Peter Bürgisser, F. Cucker, 2013, Grundlehren der mathematischen Wissenschaften.

Computing the Homology of Semialgebraic Sets. I: Lax Formulas

Felipe Cucker, Peter Bürgisser, Josué Tonelli-Cueto, 2018, Foundations of Computational Mathematics.

No Occurrence Obstructions in Geometric Complexity Theory

Greta Panova, Peter Bürgisser, Christian Ikenmeyer, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP pdf

J. M. Landsberg, Peter Bürgisser, Laurent Manivel, 2009, SIAM J. Comput..

Lower bounds on the bounded coefficient complexity of bilinear maps

Peter Bürgisser, Martin Lotz, Martin Lotz, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

On the condition of the zeros of characteristic polynomials

Felipe Cucker, Peter Bürgisser, Elisa Rocha Cardozo, 2017, J. Complex..

J an 2 01 1 AN OVERVIEW OF MATHEMATICAL ISSUES ARISING IN THE GEOMETRIC COMPLEXITY THEORY APPROACH TO VP

J. Landsberg, J. Weyman, L. Manivel, 2021 .

Optimization, Complexity and Invariant Theory

Peter Bürgisser, 2021 .

Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes

Peter Bürgisser, Avi Wigderson, Ankit Garg, 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory pdf

Peter Bürgisser, Avi Wigderson, Ankit Garg, 2017, ITCS.

The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties

Peter Bürgisser, Martin Lotz, Martin Lotz, 2005, Found. Comput. Math..

Counting complexity classes for numeric computations II: algebraic and semialgebraic sets

Felipe Cucker, Peter Bürgisser, F. Cucker, 2003, STOC '04.

On the Parallel Complexity of the Polynomial Ideal Membership Problem

Peter Bürgisser, Peter Bürgisser, 1998, J. Complex..

Completeness and Reduction in Algebraic Complexity Theory

Peter Bürgisser, Peter Bürgisser, 2000, Algorithms and computation in mathematics.

The Computational Complexity of Immanants

Peter Bürgisser, Peter Bürgisser, 2000, SIAM J. Comput..

Interior-point methods for unconstrained geometric programming and scaling problems pdf

Peter Bürgisser, Michael Walter, Yinan Li, 2020, ArXiv.

Exotic Quantifiers, Complexity Classes, and Complete Problems

Felipe Cucker, Peter Bürgisser, F. Cucker, 2007, ICALP.

Smoothed Analysis of Moore-Penrose Inversion

Felipe Cucker, Peter Bürgisser, F. Cucker, 2010, SIAM J. Matrix Anal. Appl..

Smoothed Analysis of Condition Numbers

Peter Bürgisser, Peter Bürgisser, 2011 .

Permanent versus determinant, obstructions, and Kronecker coefficients pdf

Peter Bürgisser, Peter Bürgisser, 2015, ArXiv.

Condition of Intersecting a Projective Variety with a Varying Linear Subspace

Peter Bürgisser, Peter Bürgisser, 2015, SIAM J. Appl. Algebra Geom..

Permanent versus determinant: not via saturations of monoids of representations pdf

Peter Bürgisser, Christian Ikenmeyer, Jesko Hüttenhain, 2015, ArXiv.

On the complexity of counting components of algebraic varieties

Peter Scheiblechner, Peter Bürgisser, Peter Bürgisser, 2009, J. Symb. Comput..

Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets

Felipe Cucker, Peter Bürgisser, Martin Lotz, 2005, Found. Comput. Math..

Condition Length and Complexity for the Solution of Polynomial Systems

Felipe Cucker, Michael Shub, Peter Bürgisser, 2015, Found. Comput. Math..

Algebraic Complexity Theory : With the Collaboration of Thomas Lickteig

Michael Clausen, Peter Bürgisser, Mohammad Amin Shokrollahi, 1997 .

Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time

Peter Bürgisser, Felipe Cucker, Pierre Lairez, 2017, J. ACM.

Membership in Moment Polytopes is in NP and coNP pdf

Michael Walter, Ketan Mulmuley, Matthias Christandl, 2015, SIAM J. Comput..

Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes

Avi Wigderson, Ankit Garg, Michael Walter, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Deciding Positivity of Littlewood-Richardson Coefficients

Peter Bürgisser, Christian Ikenmeyer, Peter Bürgisser, 2012, SIAM J. Discret. Math..

Computing the Homology of Semialgebraic Sets. II: General Formulas

Felipe Cucker, Peter Bürgisser, Josué Tonelli-Cueto, 2019, Foundations of Computational Mathematics.

A Coordinate-Free Condition Number for Convex Programming

Peter Bürgisser, Dennis Amelunxen, Dennis Amelunxen, 2011, SIAM J. Optim..

On the Hardness of PosSLP

Peter Bürgisser, Gorav Jindal, 2023, SODA.

The Complexity of Factors of Multivariate Polynomials

Peter Bürgisser, Peter Bürgisser, 2001, Found. Comput. Math..

Variations by complexity theorists on three themes of Euler , Bézout , Betti , and Poincaré

Peter Bürgisser, Peter Bürgisser, 2004 .

Intrinsic volumes of symmetric cones and applications in convex programming

Peter Bürgisser, Dennis Amelunxen, Dennis Amelunxen, 2015, Math. Program..

On the Structure of Valiant's Complexity Classes

Peter Bürgisser, Peter Bürgisser, 1998, Discret. Math. Theor. Comput. Sci..

Geometric complexity theory and tensor rank pdf

Peter Bürgisser, Christian Ikenmeyer, Peter Bürgisser, 2010, STOC '11.

Condition - The Geometry of Numerical Algorithms

F. Cucker, Peter Bürgisser, 2013, Grundlehren der mathematischen Wissenschaften.

Probabilistic Analysis of the Grassmann Condition Number

Peter Bürgisser, Dennis Amelunxen, Dennis Amelunxen, 2011, Found. Comput. Math..

Explicit lower bounds via geometric complexity theory pdf

Peter Bürgisser, Christian Ikenmeyer, Peter Bürgisser, 2012, STOC '13.

Prospects for Geometric Complexity Theory

Peter Bürgisser, Peter Bürgisser, 2012, 2012 IEEE 27th Conference on Computational Complexity.

Typical Tensorial Rank

Michael Clausen, Peter Bürgisser, Mohammad Amin Shokrollahi, 1997 .

Differential forms in computational algebraic geometry

Peter Scheiblechner, Peter Bürgisser, Peter Bürgisser, 2007, ISSAC '07.

The Complexity of Factors of Multivariate Polynomials

P. Burgisser, Peter Bürgisser, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Computing the Chow Variety of Quadratic Space Curves pdf

Bernd Sturmfels, Peter Bürgisser, Pierre Lairez, 2015, MACIS.

Fundamental invariants of orbit closures pdf

Peter Bürgisser, Christian Ikenmeyer, Peter Bürgisser, 2015, ArXiv.

Counting Irreducible Components of Complex Algebraic Varieties

Peter Scheiblechner, Peter Bürgisser, Peter Bürgisser, 2010, computational complexity.

The Computational Complexity to Evaluate Representations of General Linear Groups

Peter Bürgisser, Peter Bürgisser, 2000, SIAM J. Comput..

Test complexity of generic polynomials

Thomas Lickteig, Michael Shub, Peter Bürgisser, 1992, J. Complex..

The complexity of semilinear problems in succinct representation

Felipe Cucker, Peter Bürgisser, Paulin Jacobé de Naurois, 2005, computational complexity.

Counting Complexity Classes over the Reals I: The Additive Case

Felipe Cucker, Peter Bürgisser, F. Cucker, 2003, ISAAC.

On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity

Peter Bürgisser, Peter Bürgisser, 2001, MFCS.

Counting Complexity Classes for Numeric Computations I: Semilinear Sets

Felipe Cucker, Peter Bürgisser, F. Cucker, 2003, SIAM J. Comput..

On the complexity of numerical analysis

Peter Bro Miltersen, Peter Bürgisser, Johan Kjeldgaard-Pedersen, 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

Rigid continuation paths II. structured polynomial systems

F. Cucker, Peter Bürgisser, Pierre Lairez, 2020, Forum of Mathematics, Pi.

The complexity of computing Kronecker coefficients

Peter Bürgisser, Christian Ikenmeyer, Peter Bürgisser, 2008 .

Incorporating severity variations into credit risk

Peter Bürgisser, Alexandre Kurth, Peter Bürgisser, 2001 .