Peter Bürgisser

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 43

Top Venues

CoRR

Found. Comput. Math.

FOCS

SIAM J. Appl. Algebra Geom.

Publications

Peter Bürgisser, Gorav Jindal
On the Hardness of PosSLP. SODA (2024)
Peter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson
Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture. CCC (2024)
Peter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson
Complexity of Robust Orbit Problems for Torus Actions and the abc-conjecture. CoRR (2024)
Peter Bürgisser
Completeness classes in algebraic complexity theory. CoRR (2024)
Peter Bürgisser, Gorav Jindal
On the Hardness of PosSLP. CoRR (2023)
Peter Bürgisser
Real zeros of mixed random fewnomial systems. ISSAC (2023)
Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
Computing the Homology of Semialgebraic Sets. II: General Formulas. Found. Comput. Math. 21 (5) (2021)
Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson
Polynomial Time Algorithms in Invariant Theory for Torus Actions. Computational Complexity Conference (2021)
Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson
Polynomial time algorithms in invariant theory for torus actions. CoRR (2021)
Peter Bürgisser
Optimization, Complexity and Invariant Theory (Invited Talk). STACS (2021)
Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
Computing the Homology of Semialgebraic Sets. I: Lax Formulas. Found. Comput. Math. 20 (1) (2020)
Irénée Briquel, Peter Bürgisser
The real tau-conjecture is true on average. Random Struct. Algorithms 57 (2) (2020)
Peter Bürgisser, Felipe Cucker, Pierre Lairez
Rigid continuation paths II. Structured polynomial systems. CoRR (2020)
Peter Bürgisser
Correction To: The Complexity of Factors of Multivariate Polynomials. Found. Comput. Math. 20 (6) (2020)
Peter Bürgisser, Yinan Li, Harold Nieuwboer, Michael Walter
Interior-point methods for unconstrained geometric programming and scaling problems. CoRR (2020)
Peter Bürgisser, Felipe Cucker, Pierre Lairez
Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time. J. ACM 66 (1) (2019)
Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
Computing the Homology of Semialgebraic Sets. II: General formulas. CoRR (2019)
Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes. FOCS (2019)
Peter Bürgisser, Alperen Ali Ergür, Josué Tonelli-Cueto
On the Number of Real Zeros of Random Fewnomials. SIAM J. Appl. Algebra Geom. 3 (4) (2019)
Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes. CoRR (2019)
Peter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory. ITCS (2018)
Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
Computing the Homology of Semialgebraic Sets I: Lax Formulas. CoRR (2018)
Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
Efficient algorithms for tensor scaling, quantum marginals and moment polytopes. CoRR (2018)
Irénée Briquel, Peter Bürgisser
The real tau-conjecture is true on average. CoRR (2018)
Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes. FOCS (2018)
Peter Bürgisser
The Complexity of Factors of Multivariate Polynomials. CoRR (2018)
Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley, Michael Walter
Membership in Moment Polytopes is in NP and coNP. SIAM J. Comput. 46 (3) (2017)
Peter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory. CoRR (2017)
Felipe Cucker, Peter Bürgisser, Pierre Lairez
Computing the homology of basic semialgebraic sets in weak exponential time. CoRR (2017)
Peter Bürgisser, Felipe Cucker, Elisa Rocha Cardozo
On the condition of the zeros of characteristic polynomials. J. Complex. 42 (2017)
Peter Bürgisser
Condition of Intersecting a Projective Variety with a Varying Linear Subspace. SIAM J. Appl. Algebra Geom. 1 (1) (2017)
Peter Bürgisser, Christian Ikenmeyer, Greta Panova
No occurrence obstructions in geometric complexity theory. CoRR (2016)
Diego Armentano, Carlos Beltrán, Peter Bürgisser, Felipe Cucker, Michael Shub
Condition Length and Complexity for the Solution of Polynomial Systems. Found. Comput. Math. 16 (6) (2016)
Peter Bürgisser, Christian Ikenmeyer, Greta Panova
No Occurrence Obstructions in Geometric Complexity Theory. FOCS (2016)
Peter Bürgisser
Permanent versus determinant, obstructions, and Kronecker coefficients. CoRR (2015)
Peter Bürgisser, Christian Ikenmeyer
Fundamental invariants of orbit closures. CoRR (2015)
Peter Bürgisser, Kathlén Kohn, Pierre Lairez, Bernd Sturmfels
Computing the Chow Variety of Quadratic Space Curves. MACIS (2015)
Peter Bürgisser, Kathlén Kohn, Pierre Lairez, Bernd Sturmfels
Computing the Chow variety of quadratic space curves. CoRR (2015)
Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley, Michael Walter
Membership in moment polytopes is in NP and coNP. CoRR (2015)
Dennis Amelunxen, Peter Bürgisser
Probabilistic Analysis of the Grassmann Condition Number. Found. Comput. Math. 15 (1) (2015)
Peter Bürgisser, Christian Ikenmeyer, Jesko Hüttenhain
Permanent versus determinant: not via saturations of monoids of representations. CoRR (2015)
Dennis Amelunxen, Peter Bürgisser
Intrinsic volumes of symmetric cones and applications in convex programming. Math. Program. 149 (1-2) (2015)
Peter Bürgisser, Felipe Cucker, Marek Karpinski, Nicolai N. Vorobjov Jr.
Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). Dagstuhl Reports 5 (6) (2015)
Peter Bürgisser, Christian Ikenmeyer
Explicit lower bounds via geometric complexity theory. STOC (2013)
Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, Pascal Koiran
Computational Counting (Dagstuhl Seminar 13031). Dagstuhl Reports 3 (1) (2013)
Peter Bürgisser, Christian Ikenmeyer
Deciding Positivity of Littlewood-Richardson Coefficients. SIAM J. Discret. Math. 27 (4) (2013)
Dennis Amelunxen, Peter Bürgisser
A Coordinate-Free Condition Number for Convex Programming. SIAM J. Optim. 22 (3) (2012)
Peter Bürgisser, Dennis Amelunxen
Robust smoothed analysis of a condition number for linear programming. Math. Program. 131 (1-2) (2012)
Peter Bürgisser, Christian Ikenmeyer
Explicit Lower Bounds via Geometric Complexity Theory CoRR (2012)
Peter Bürgisser
Prospects for Geometric Complexity Theory. Computational Complexity Conference (2012)
Peter Bürgisser, Christian Ikenmeyer
Geometric complexity theory and tensor rank. STOC (2011)
Peter Bürgisser
Probabilistic analysis of condition numbers. ISSAC (2011)
Peter Bürgisser, J. M. Landsberg, Laurent Manivel, Jerzy Weyman
An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP. SIAM J. Comput. 40 (4) (2011)
Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum
10481 Abstracts Collection - Computational Counting. Computational Counting (2010)
Peter Bürgisser, Christian Ikenmeyer
Geometric Complexity Theory and Tensor Rank CoRR (2010)
Peter Bürgisser, Felipe Cucker
Smoothed Analysis of Moore-Penrose Inversion. SIAM J. Matrix Anal. Appl. 31 (5) (2010)
Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum
10481 Executive Summary - Computational Counting. Computational Counting (2010)
Peter Bürgisser, Felipe Cucker
Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. STOC (2010)
Peter Bürgisser, Peter Scheiblechner
Counting Irreducible Components of Complex Algebraic Varieties. Comput. Complex. 19 (1) (2010)
Peter Bürgisser, Peter Scheiblechner
On the complexity of counting components of algebraic varieties. J. Symb. Comput. 44 (9) (2009)
Peter Bürgisser, J. M. Landsberg, Laurent Manivel, Jerzy Weyman
An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP CoRR (2009)
Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
On the Complexity of Numerical Analysis. SIAM J. Comput. 38 (5) (2009)
Peter Bürgisser
On Defining Integers And Proving Arithmetic Circuit Lower Bounds. Comput. Complex. 18 (1) (2009)
Peter Bürgisser, Felipe Cucker
Exotic Quantifiers, Complexity Classes, and Complete Problems. Found. Comput. Math. 9 (2) (2009)
Peter Bürgisser, Andrei Gabrielov, Teresa Krick, Gregorio Malajovich
Guest Editor's Preface. J. Complex. 24 (1) (2008)
Peter Bürgisser, Felipe Cucker, Martin Lotz
The probability that a slightly perturbed numerical analysis problem is difficult. Math. Comput. 77 (263) (2008)
Peter Bürgisser, Martin Lotz
The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties. Found. Comput. Math. 7 (1) (2007)
Peter Bürgisser
On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds. STACS (2007)
Peter Bürgisser, Peter Scheiblechner
Differential forms in computational algebraic geometry. ISSAC (2007)
Peter Bürgisser, Felipe Cucker
Exotic Quantifiers, Complexity Classes, and Complete Problems. ICALP (2007)
Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
The complexity of semilinear problems in succinct representation. Comput. Complex. 15 (3) (2006)
Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
On the Complexity of Numerical Analysis. Complexity of Boolean Functions (2006)
Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
On the Complexity of Numerical Analysis. Computational Complexity Conference (2006)
Peter Bürgisser
On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity. Electron. Colloquium Comput. Complex. 13 (113) (2006)
Peter Bürgisser, Felipe Cucker
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. J. Complex. 22 (2) (2006)
Peter Bürgisser, Martin Lotz
The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties CoRR (2005)
Peter Bürgisser, Felipe Cucker
Exotic quantifiers, complexity classes, and complete problems Electron. Colloquium Comput. Complex. (138) (2005)
Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
The Complexity of Semilinear Problems in Succinct Representation. FCT (2005)
Peter Bürgisser, Felipe Cucker, Martin Lotz
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. Found. Comput. Math. 5 (4) (2005)
Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
On the Complexity of Numerical Analysis Electron. Colloquium Comput. Complex. (037) (2005)
Peter Bürgisser, Felipe Cucker
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. STOC (2004)
Peter Bürgisser
The Complexity of Factors of Multivariate Polynomials. Found. Comput. Math. 4 (4) (2004)
Peter Bürgisser, Martin Lotz
Lower bounds on the bounded coefficient complexity of bilinear maps. J. ACM 51 (3) (2004)
Peter Bürgisser, Felipe Cucker
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets CoRR (2003)
Peter Bürgisser, Martin Lotz
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps CoRR (2003)
Peter Bürgisser, Felipe Cucker
Counting Complexity Classes for Numeric Computations I: Semilinear Sets. SIAM J. Comput. 33 (1) (2003)
Peter Bürgisser, Felipe Cucker
Counting Complexity Classes over the Reals I: The Additive Case. ISAAC (2003)
Peter Bürgisser, Martin Lotz
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. FOCS (2002)
Peter Bürgisser
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity. MFCS (2001)
Peter Bürgisser
Lower Bounds and Real Algebraic Geometry. Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science (2001)
Peter Bürgisser
The Complexity of Factors of Multivariate Polynomials. FOCS (2001)
Peter Bürgisser
The Computational Complexity to Evaluate Representations of General Linear Groups. SIAM J. Comput. 30 (3) (2000)
Peter Bürgisser
The Computational Complexity of Immanants. SIAM J. Comput. 30 (3) (2000)
Peter Bürgisser
Cook's versus Valiant's hypothesis. Theor. Comput. Sci. 235 (1) (2000)
Peter Bürgisser
On the Structure of Valiant's Complexity Classes. Discret. Math. Theor. Comput. Sci. 3 (3) (1999)
Peter Bürgisser
On the Structure of Valiant's Complexity Classes. STACS (1998)
Peter Bürgisser
On the Parallel Complexity of the Polynomial Ideal Membership Problem. J. Complex. 14 (2) (1998)
Peter Bürgisser, Marek Karpinski, Thomas Lickteig
On Randomized Semi-algebraic Test Complexity. J. Complex. 9 (2) (1993)
Peter Bürgisser, Thomas Lickteig, Michael Shub
Test complexity of generic polynomials. J. Complex. 8 (3) (1992)
Peter Bürgisser, Marek Karpinski, Thomas Lickteig
Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication. Comput. Complex. 1 (1991)

Peter Bürgisser.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter Bürgisser