Peter Bürgisser

105 papers A* 11A 8B 6Journal 71Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop. CoRR Noah Amsel, Yves Baumann, Paul Beckman, Peter Bürgisser, Chris Camaño, Tyler Chen, Edmond Chow, Anil Damle, Michal Derezinski, Mark Embree, Ethan N. Epperly, Robert D. Falgout, Mark Fornace, Anne Greenbaum, Chen Greif, Diana Halikias, Zhen Huang, Elias Jarlebring, Yiannis Koutis, Daniel Kressner, Rasmus Kyng, Jörg Liesen, Jackie Lok, Raphael A. Meyer, Yuji Nakatsukasa, Kate Pearce, Richard Peng, David Persson, Elizaveta Rebrova, Ryan Schneider, Rikhav Shah, Edgar Solomonik, Nikhil Srivastava, Alex Townsend, Robert J. Webber, Jess Williams
2024	J	`jnl`	Completeness classes in algebraic complexity theory. CoRR Peter Bürgisser
2024	A	`conf`	Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture. CCC Peter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson
2024	J	`jnl`	Complexity of Robust Orbit Problems for Torus Actions and the abc-conjecture. CoRR Peter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson
2024	A*	`conf`	On the Hardness of PosSLP. SODA Peter Bürgisser, Gorav Jindal
2023	J	`jnl`	On the Hardness of PosSLP. CoRR Peter Bürgisser, Gorav Jindal
2023	B	`conf`	Real zeros of mixed random fewnomial systems. ISSAC Peter Bürgisser
2021	J	`jnl`	Computing the Homology of Semialgebraic Sets. II: General Formulas. Found. Comput. Math. Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
2021	A	`conf`	Optimization, Complexity and Invariant Theory (Invited Talk). STACS Peter Bürgisser
2021	A	`conf`	Polynomial Time Algorithms in Invariant Theory for Torus Actions. CCC Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson
2021	J	`jnl`	Polynomial time algorithms in invariant theory for torus actions. CoRR Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson
2020	J	`jnl`	Computing the Homology of Semialgebraic Sets. I: Lax Formulas. Found. Comput. Math. Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
2020	J	`jnl`	Correction To: The Complexity of Factors of Multivariate Polynomials. Found. Comput. Math. Peter Bürgisser
2020	J	`jnl`	Interior-point methods for unconstrained geometric programming and scaling problems. CoRR Peter Bürgisser, Yinan Li, Harold Nieuwboer, Michael Walter
2020	J	`jnl`	Rigid continuation paths II. Structured polynomial systems. CoRR Peter Bürgisser, Felipe Cucker, Pierre Lairez
2020	J	`jnl`	The real tau-conjecture is true on average. Random Struct. Algorithms Irénée Briquel, Peter Bürgisser
2019	J	`jnl`	Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time. J. ACM Peter Bürgisser, Felipe Cucker, Pierre Lairez
2019	J	`jnl`	Computing the Homology of Semialgebraic Sets. II: General formulas. CoRR Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
2019	J	`jnl`	On the Number of Real Zeros of Random Fewnomials. SIAM J. Appl. Algebra Geom. Peter Bürgisser, Alperen Ali Ergür, Josué Tonelli-Cueto
2019	A*	`conf`	Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes. FOCS Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
2019	J	`jnl`	Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes. CoRR Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
2018	A	`conf`	Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory. ITCS Peter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
2018	J	`jnl`	Computing the Homology of Semialgebraic Sets I: Lax Formulas. CoRR Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
2018	A*	`conf`	Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes. FOCS Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
2018	J	`jnl`	Efficient algorithms for tensor scaling, quantum marginals and moment polytopes. CoRR Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
2018	J	`jnl`	The Complexity of Factors of Multivariate Polynomials. CoRR Peter Bürgisser
2018	J	`jnl`	The real tau-conjecture is true on average. CoRR Irénée Briquel, Peter Bürgisser
2017	J	`jnl`	Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory. CoRR Peter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
2017	J	`jnl`	Computing the homology of basic semialgebraic sets in weak exponential time. CoRR Felipe Cucker, Peter Bürgisser, Pierre Lairez
2017	J	`jnl`	Condition of Intersecting a Projective Variety with a Varying Linear Subspace. SIAM J. Appl. Algebra Geom. Peter Bürgisser
2017	J	`jnl`	Membership in Moment Polytopes is in NP and coNP. SIAM J. Comput. Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley, Michael Walter
2017	J	`jnl`	On the condition of the zeros of characteristic polynomials. J. Complex. Peter Bürgisser, Felipe Cucker, Elisa Rocha Cardozo
2016	J	`jnl`	Condition Length and Complexity for the Solution of Polynomial Systems. Found. Comput. Math. Diego Armentano, Carlos Beltrán, Peter Bürgisser, Felipe Cucker, Michael Shub
2016	A*	`conf`	No Occurrence Obstructions in Geometric Complexity Theory. FOCS Peter Bürgisser, Christian Ikenmeyer, Greta Panova
2016	J	`jnl`	No occurrence obstructions in geometric complexity theory. CoRR Peter Bürgisser, Christian Ikenmeyer, Greta Panova
2015	J	`jnl`	Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). Dagstuhl Reports Peter Bürgisser, Felipe Cucker, Marek Karpinski, Nicolai N. Vorobjov Jr.
2015	—	`conf`	Computing the Chow Variety of Quadratic Space Curves. MACIS Peter Bürgisser, Kathlén Kohn, Pierre Lairez, Bernd Sturmfels
2015	J	`jnl`	Computing the Chow variety of quadratic space curves. CoRR Peter Bürgisser, Kathlén Kohn, Pierre Lairez, Bernd Sturmfels
2015	J	`jnl`	Fundamental invariants of orbit closures. CoRR Peter Bürgisser, Christian Ikenmeyer
2015	J	`jnl`	Intrinsic volumes of symmetric cones and applications in convex programming. Math. Program. Dennis Amelunxen, Peter Bürgisser
2015	J	`jnl`	Membership in moment polytopes is in NP and coNP. CoRR Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley, Michael Walter
2015	J	`jnl`	Permanent versus determinant, obstructions, and Kronecker coefficients. CoRR Peter Bürgisser
2015	J	`jnl`	Permanent versus determinant: not via saturations of monoids of representations. CoRR Peter Bürgisser, Christian Ikenmeyer, Jesko Hüttenhain
2015	J	`jnl`	Probabilistic Analysis of the Grassmann Condition Number. Found. Comput. Math. Dennis Amelunxen, Peter Bürgisser
2013	J	`jnl`	Computational Counting (Dagstuhl Seminar 13031). Dagstuhl Reports Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, Pascal Koiran
2013	—	`book`	Condition - The Geometry of Numerical Algorithms. Peter Bürgisser, Felipe Cucker
2013	J	`jnl`	Deciding Positivity of Littlewood-Richardson Coefficients. SIAM J. Discret. Math. Peter Bürgisser, Christian Ikenmeyer
2013	A*	`conf`	Explicit lower bounds via geometric complexity theory. STOC Peter Bürgisser, Christian Ikenmeyer
2012	J	`jnl`	A Coordinate-Free Condition Number for Convex Programming. SIAM J. Optim. Dennis Amelunxen, Peter Bürgisser
2012	J	`jnl`	Explicit Lower Bounds via Geometric Complexity Theory CoRR Peter Bürgisser, Christian Ikenmeyer
2012	A	`conf`	Prospects for Geometric Complexity Theory. CCC Peter Bürgisser
2012	J	`jnl`	Robust smoothed analysis of a condition number for linear programming. Math. Program. Peter Bürgisser, Dennis Amelunxen
2011	J	`jnl`	An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP. SIAM J. Comput. Peter Bürgisser, J. M. Landsberg, Laurent Manivel, Jerzy Weyman
2011	A*	`conf`	Geometric complexity theory and tensor rank. STOC Peter Bürgisser, Christian Ikenmeyer
2011	B	`conf`	Probabilistic analysis of condition numbers. ISSAC Peter Bürgisser
2010	—	`conf`	10481 Abstracts Collection - Computational Counting. Computational Counting Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum
2010	—	`conf`	10481 Executive Summary - Computational Counting. Computational Counting Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum
2010	—	`ed.`	Computational Counting, 28.11. - 03.12.2010 Computational Counting Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	Counting Irreducible Components of Complex Algebraic Varieties. Comput. Complex. Peter Bürgisser, Peter Scheiblechner
2010	J	`jnl`	Geometric Complexity Theory and Tensor Rank CoRR Peter Bürgisser, Christian Ikenmeyer
2010	J	`jnl`	Smoothed Analysis of Moore-Penrose Inversion. SIAM J. Matrix Anal. Appl. Peter Bürgisser, Felipe Cucker
2010	A*	`conf`	Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. STOC Peter Bürgisser, Felipe Cucker
2009	J	`jnl`	An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP CoRR Peter Bürgisser, J. M. Landsberg, Laurent Manivel, Jerzy Weyman
2009	J	`jnl`	Exotic Quantifiers, Complexity Classes, and Complete Problems. Found. Comput. Math. Peter Bürgisser, Felipe Cucker
2009	J	`jnl`	On Defining Integers And Proving Arithmetic Circuit Lower Bounds. Comput. Complex. Peter Bürgisser
2009	J	`jnl`	On the Complexity of Numerical Analysis. SIAM J. Comput. Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
2009	J	`jnl`	On the complexity of counting components of algebraic varieties. J. Symb. Comput. Peter Bürgisser, Peter Scheiblechner
2008	J	`jnl`	Guest Editor's Preface. J. Complex. Peter Bürgisser, Andrei Gabrielov, Teresa Krick, Gregorio Malajovich
2008	J	`jnl`	The probability that a slightly perturbed numerical analysis problem is difficult. Math. Comput. Peter Bürgisser, Felipe Cucker, Martin Lotz
2007	B	`conf`	Differential forms in computational algebraic geometry. ISSAC Peter Bürgisser, Peter Scheiblechner
2007	A*	`conf`	Exotic Quantifiers, Complexity Classes, and Complete Problems. ICALP Peter Bürgisser, Felipe Cucker
2007	A	`conf`	On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds. STACS Peter Bürgisser
2007	J	`jnl`	The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties. Found. Comput. Math. Peter Bürgisser, Martin Lotz
2006	J	`jnl`	Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. J. Complex. Peter Bürgisser, Felipe Cucker
2006	J	`jnl`	On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity. Electron. Colloquium Comput. Complex. Peter Bürgisser
2006	A	`conf`	On the Complexity of Numerical Analysis. CCC Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
2006	—	`conf`	On the Complexity of Numerical Analysis. Complexity of Boolean Functions Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
2006	J	`jnl`	The complexity of semilinear problems in succinct representation. Comput. Complex. Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
2005	J	`jnl`	Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. Found. Comput. Math. Peter Bürgisser, Felipe Cucker, Martin Lotz
2005	J	`jnl`	Exotic quantifiers, complexity classes, and complete problems Electron. Colloquium Comput. Complex. Peter Bürgisser, Felipe Cucker
2005	J	`jnl`	On the Complexity of Numerical Analysis Electron. Colloquium Comput. Complex. Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
2005	B	`conf`	The Complexity of Semilinear Problems in Succinct Representation. FCT Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
2005	J	`jnl`	The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties CoRR Peter Bürgisser, Martin Lotz
2004	A*	`conf`	Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. STOC Peter Bürgisser, Felipe Cucker
2004	J	`jnl`	Lower bounds on the bounded coefficient complexity of bilinear maps. J. ACM Peter Bürgisser, Martin Lotz
2004	J	`jnl`	The Complexity of Factors of Multivariate Polynomials. Found. Comput. Math. Peter Bürgisser
2003	J	`jnl`	Counting Complexity Classes for Numeric Computations I: Semilinear Sets. SIAM J. Comput. Peter Bürgisser, Felipe Cucker
2003	B	`conf`	Counting Complexity Classes over the Reals I: The Additive Case. ISAAC Peter Bürgisser, Felipe Cucker
2003	J	`jnl`	Counting complexity classes for numeric computations II: algebraic and semialgebraic sets CoRR Peter Bürgisser, Felipe Cucker
2003	J	`jnl`	Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps CoRR Peter Bürgisser, Martin Lotz
2002	A*	`conf`	Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. FOCS Peter Bürgisser, Martin Lotz
2001	—	`conf`	Lower Bounds and Real Algebraic Geometry. Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science Peter Bürgisser
2001	B	`conf`	On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity. MFCS Peter Bürgisser
2001	A*	`conf`	The Complexity of Factors of Multivariate Polynomials. FOCS Peter Bürgisser
2000	—	`book`	Completeness and Reduction in Algebraic Complexity Theory. Peter Bürgisser
2000	J	`jnl`	Cook's versus Valiant's hypothesis. Theor. Comput. Sci. Peter Bürgisser
2000	J	`jnl`	The Computational Complexity of Immanants. SIAM J. Comput. Peter Bürgisser
2000	J	`jnl`	The Computational Complexity to Evaluate Representations of General Linear Groups. SIAM J. Comput. Peter Bürgisser
1999	J	`jnl`	On the Structure of Valiant's Complexity Classes. Discret. Math. Theor. Comput. Sci. Peter Bürgisser
1998	J	`jnl`	On the Parallel Complexity of the Polynomial Ideal Membership Problem. J. Complex. Peter Bürgisser
1998	A	`conf`	On the Structure of Valiant's Complexity Classes. STACS Peter Bürgisser
1997	—	`book`	Algebraic complexity theory. Peter Bürgisser, Michael Clausen, Mohammad Amin Shokrollahi
1993	J	`jnl`	On Randomized Semi-algebraic Test Complexity. J. Complex. Peter Bürgisser, Marek Karpinski, Thomas Lickteig
1992	J	`jnl`	Test complexity of generic polynomials. J. Complex. Peter Bürgisser, Thomas Lickteig, Michael Shub
1991	J	`jnl`	Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication. Comput. Complex. Peter Bürgisser, Marek Karpinski, Thomas Lickteig