default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Bürgisser
Person information
- affiliation: TU Berlin, Institute of Mathematics, Germany
- affiliation: University of Paderborn, Department of Mathematics, Germany
SPARQL queries 
🛈 Please note that only 69% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c27]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: 14:1-14:48- [c26]Peter Bürgisser, Gorav Jindal:
On the Hardness of PosSLP. SODA 2024: 1872-1886 - [i34]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 abs/2405.15368 (2024) - [i33]Peter Bürgisser:
Completeness classes in algebraic complexity theory. CoRR abs/2406.06217 (2024) - 2023
- [c25]Peter Bürgisser
:
Real zeros of mixed random fewnomial systems. ISSAC 2023: 107-115 - [i32]Peter Bürgisser, Gorav Jindal:
On the Hardness of PosSLP. CoRR abs/2307.08008 (2023) - 2021
- [j39]Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto:
Computing the Homology of Semialgebraic Sets. II: General Formulas. Found. Comput. Math. 21(5): 1279-1316 (2021) - [c24]Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Polynomial Time Algorithms in Invariant Theory for Torus Actions. CCC 2021: 32:1-32:30 - [c23]Peter Bürgisser:
Optimization, Complexity and Invariant Theory (Invited Talk). STACS 2021: 1:1-1:20 - [i31]Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Polynomial time algorithms in invariant theory for torus actions. CoRR abs/2102.07727 (2021) - 2020
- [j38]Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto:
Computing the Homology of Semialgebraic Sets. I: Lax Formulas. Found. Comput. Math. 20(1): 71-118 (2020) - [j37]Peter Bürgisser:
Correction To: The Complexity of Factors of Multivariate Polynomials. Found. Comput. Math. 20(6): 1667-1668 (2020) - [j36]Irénée Briquel, Peter Bürgisser:
The real tau-conjecture is true on average. Random Struct. Algorithms 57(2): 279-303 (2020) - [i30]Peter Bürgisser, Yinan Li, Harold Nieuwboer, Michael Walter:
Interior-point methods for unconstrained geometric programming and scaling problems. CoRR abs/2008.12110 (2020) - [i29]Peter Bürgisser, Felipe Cucker, Pierre Lairez:
Rigid continuation paths II. Structured polynomial systems. CoRR abs/2010.10997 (2020)
2010 – 2019
- 2019
- [j35]Peter Bürgisser, Felipe Cucker, Pierre Lairez:
Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time. J. ACM 66(1): 5:1-5:30 (2019) - [j34]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): 721-732 (2019) - [c22]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: 845-861 - [i28]Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto:
Computing the Homology of Semialgebraic Sets. II: General formulas. CoRR abs/1903.10710 (2019) - [i27]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 abs/1910.12375 (2019) - 2018
- [c21]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: 883-897 - [c20]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: 24:1-24:20 - [i26]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 abs/1804.04739 (2018) - [i25]Irénée Briquel, Peter Bürgisser:
The real tau-conjecture is true on average. CoRR abs/1806.00417 (2018) - [i24]Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto:
Computing the Homology of Semialgebraic Sets I: Lax Formulas. CoRR abs/1807.06435 (2018) - [i23]Peter Bürgisser:
The Complexity of Factors of Multivariate Polynomials. CoRR abs/1812.06828 (2018) - 2017
- [j33]Peter Bürgisser, Felipe Cucker, Elisa Rocha Cardozo:
On the condition of the zeros of characteristic polynomials. J. Complex. 42: 72-84 (2017) - [j32]Peter Bürgisser:
Condition of Intersecting a Projective Variety with a Varying Linear Subspace. SIAM J. Appl. Algebra Geom. 1(1): 111-125 (2017) - [j31]Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley, Michael Walter:
Membership in Moment Polytopes is in NP and coNP. SIAM J. Comput. 46(3): 972-991 (2017) - [i22]Felipe Cucker, Peter Bürgisser, Pierre Lairez:
Computing the homology of basic semialgebraic sets in weak exponential time. CoRR abs/1706.07473 (2017) - [i21]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 abs/1711.08039 (2017) - 2016
- [j30]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): 1401-1422 (2016) - [c19]Peter Bürgisser, Christian Ikenmeyer, Greta Panova:
No Occurrence Obstructions in Geometric Complexity Theory. FOCS 2016: 386-395 - [i20]Peter Bürgisser, Christian Ikenmeyer, Greta Panova:
No occurrence obstructions in geometric complexity theory. CoRR abs/1604.06431 (2016) - 2015
- [j29]Dennis Amelunxen, Peter Bürgisser:
Probabilistic Analysis of the Grassmann Condition Number. Found. Comput. Math. 15(1): 3-51 (2015) - [j28]Dennis Amelunxen, Peter Bürgisser:
Intrinsic volumes of symmetric cones and applications in convex programming. Math. Program. 149(1-2): 105-130 (2015) - [c18]Peter Bürgisser, Kathlén Kohn, Pierre Lairez, Bernd Sturmfels:
Computing the Chow Variety of Quadratic Space Curves. MACIS 2015: 130-136 - [i19]Peter Bürgisser, Christian Ikenmeyer, Jesko Hüttenhain:
Permanent versus determinant: not via saturations of monoids of representations. CoRR abs/1501.05528 (2015) - [i18]Peter Bürgisser, Kathlén Kohn, Pierre Lairez, Bernd Sturmfels:
Computing the Chow variety of quadratic space curves. CoRR abs/1508.07219 (2015) - [i17]Peter Bürgisser, Christian Ikenmeyer:
Fundamental invariants of orbit closures. CoRR abs/1511.02927 (2015) - [i16]Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley, Michael Walter:
Membership in moment polytopes is in NP and coNP. CoRR abs/1511.03675 (2015) - [i15]Peter Bürgisser:
Permanent versus determinant, obstructions, and Kronecker coefficients. CoRR abs/1511.08113 (2015) - [i14]Peter Bürgisser, Felipe Cucker, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). Dagstuhl Reports 5(6): 28-47 (2015) - 2013
- [b3]Peter Bürgisser, Felipe Cucker:
Condition - The Geometry of Numerical Algorithms. Grundlehren der mathematischen Wissenschaften 349, Springer 2013, ISBN 978-3-642-38895-8, pp. I-XXXI, 1-554 - [j27]Peter Bürgisser, Christian Ikenmeyer:
Deciding Positivity of Littlewood-Richardson Coefficients. SIAM J. Discret. Math. 27(4): 1639-1681 (2013) - [c17]Peter Bürgisser, Christian Ikenmeyer:
Explicit lower bounds via geometric complexity theory. STOC 2013: 141-150 - [i13]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, Pascal Koiran:
Computational Counting (Dagstuhl Seminar 13031). Dagstuhl Reports 3(1): 47-66 (2013) - 2012
- [j26]Peter Bürgisser, Dennis Amelunxen:
Robust smoothed analysis of a condition number for linear programming. Math. Program. 131(1-2): 221-251 (2012) - [j25]Dennis Amelunxen, Peter Bürgisser:
A Coordinate-Free Condition Number for Convex Programming. SIAM J. Optim. 22(3): 1029-1041 (2012) - [c16]Peter Bürgisser:
Prospects for Geometric Complexity Theory. CCC 2012: 235 - [i12]Peter Bürgisser, Christian Ikenmeyer:
Explicit Lower Bounds via Geometric Complexity Theory. CoRR abs/1210.8368 (2012) - 2011
- [j24]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): 1179-1209 (2011) - [c15]Peter Bürgisser:
Probabilistic analysis of condition numbers. ISSAC 2011: 5-6 - [c14]Peter Bürgisser, Christian Ikenmeyer:
Geometric complexity theory and tensor rank. STOC 2011: 509-518 - 2010
- [j23]Peter Bürgisser, Peter Scheiblechner:
Counting Irreducible Components of Complex Algebraic Varieties. Comput. Complex. 19(1): 1-35 (2010) - [j22]Peter Bürgisser, Felipe Cucker:
Smoothed Analysis of Moore-Penrose Inversion. SIAM J. Matrix Anal. Appl. 31(5): 2769-2783 (2010) - [c13]Peter Bürgisser, Felipe Cucker:
Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. STOC 2010: 503-512 - [e1]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum:
Computational Counting, 28.11. - 03.12.2010. Dagstuhl Seminar Proceedings 10481, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i11]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum:
10481 Abstracts Collection - Computational Counting. Computational Counting 2010 - [i10]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum:
10481 Executive Summary - Computational Counting. Computational Counting 2010 - [i9]Peter Bürgisser, Christian Ikenmeyer:
Geometric Complexity Theory and Tensor Rank. CoRR abs/1011.1350 (2010)
2000 – 2009
- 2009
- [j21]Peter Bürgisser:
On Defining Integers And Proving Arithmetic Circuit Lower Bounds. Comput. Complex. 18(1): 81-103 (2009) - [j20]Peter Bürgisser, Felipe Cucker:
Exotic Quantifiers, Complexity Classes, and Complete Problems. Found. Comput. Math. 9(2): 135-170 (2009) - [j19]Peter Bürgisser, Peter Scheiblechner:
On the complexity of counting components of algebraic varieties. J. Symb. Comput. 44(9): 1114-1136 (2009) - [j18]Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen:
On the Complexity of Numerical Analysis. SIAM J. Comput. 38(5): 1987-2006 (2009) - [i8]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 abs/0907.2850 (2009) - 2008
- [j17]Peter Bürgisser, Andrei Gabrielov, Teresa Krick, Gregorio Malajovich:
Guest Editor's Preface. J. Complex. 24(1): 2 (2008) - [j16]Peter Bürgisser, Felipe Cucker, Martin Lotz:
The probability that a slightly perturbed numerical analysis problem is difficult. Math. Comput. 77(263): 1559-1583 (2008) - 2007
- [j15]Peter Bürgisser, Martin Lotz:
The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties. Found. Comput. Math. 7(1): 59-86 (2007) - [c12]Peter Bürgisser, Felipe Cucker:
Exotic Quantifiers, Complexity Classes, and Complete Problems. ICALP 2007: 207-218 - [c11]Peter Bürgisser, Peter Scheiblechner:
Differential forms in computational algebraic geometry. ISSAC 2007: 61-68 - [c10]Peter Bürgisser:
On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds. STACS 2007: 133-144 - 2006
- [j14]Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois:
The complexity of semilinear problems in succinct representation. Comput. Complex. 15(3): 197-235 (2006) - [j13]Peter Bürgisser, Felipe Cucker:
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. J. Complex. 22(2): 147-191 (2006) - [c9]Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen:
On the Complexity of Numerical Analysis. CCC 2006: 331-339 - [i7]Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen:
On the Complexity of Numerical Analysis. Complexity of Boolean Functions 2006 - [i6]Peter Bürgisser:
On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j12]Peter Bürgisser, Felipe Cucker, Martin Lotz:
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. Found. Comput. Math. 5(4): 351-387 (2005) - [c8]Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois:
The Complexity of Semilinear Problems in Succinct Representation. FCT 2005: 479-490 - [i5]Peter Bürgisser, Martin Lotz:
The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties. CoRR abs/cs/0502044 (2005) - [i4]Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen:
On the Complexity of Numerical Analysis. Electron. Colloquium Comput. Complex. TR05 (2005) - [i3]Peter Bürgisser, Felipe Cucker:
Exotic quantifiers, complexity classes, and complete problems. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j11]Peter Bürgisser:
The Complexity of Factors of Multivariate Polynomials. Found. Comput. Math. 4(4): 369-396 (2004) - [j10]Peter Bürgisser, Martin Lotz:
Lower bounds on the bounded coefficient complexity of bilinear maps. J. ACM 51(3): 464-482 (2004) - [c7]Peter Bürgisser, Felipe Cucker:
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. STOC 2004: 475-485 - 2003
- [j9]Peter Bürgisser, Felipe Cucker:
Counting Complexity Classes for Numeric Computations I: Semilinear Sets. SIAM J. Comput. 33(1): 227-260 (2003) - [c6]Peter Bürgisser, Felipe Cucker:
Counting Complexity Classes over the Reals I: The Additive Case. ISAAC 2003: 625-634 - [i2]Peter Bürgisser, Martin Lotz:
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. CoRR cs.CC/0301016 (2003) - [i1]Peter Bürgisser, Felipe Cucker:
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. CoRR cs.CC/0312007 (2003) - 2002
- [c5]Peter Bürgisser, Martin Lotz:
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. FOCS 2002: 659-668 - 2001
- [c4]Peter Bürgisser:
Lower Bounds and Real Algebraic Geometry. Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science 2001: 35-54 - [c3]Peter Bürgisser:
The Complexity of Factors of Multivariate Polynomials. FOCS 2001: 378-385 - [c2]Peter Bürgisser:
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity. MFCS 2001: 3-17 - 2000
- [b2]Peter Bürgisser:
Completeness and Reduction in Algebraic Complexity Theory. Algorithms and computation in mathematics 7, Springer 2000, ISBN 978-3-540-66752-0, pp. I-XII, 1-168 - [j8]Peter Bürgisser:
The Computational Complexity to Evaluate Representations of General Linear Groups. SIAM J. Comput. 30(3): 1010-1022 (2000) - [j7]Peter Bürgisser:
The Computational Complexity of Immanants. SIAM J. Comput. 30(3): 1023-1040 (2000) - [j6]Peter Bürgisser:
Cook's versus Valiant's hypothesis. Theor. Comput. Sci. 235(1): 71-88 (2000)
1990 – 1999
- 1999
- [j5]Peter Bürgisser:
On the Structure of Valiant's Complexity Classes. Discret. Math. Theor. Comput. Sci. 3(3): 73-94 (1999) - 1998
- [j4]Peter Bürgisser:
On the Parallel Complexity of the Polynomial Ideal Membership Problem. J. Complex. 14(2): 176-189 (1998) - [c1]Peter Bürgisser:
On the Structure of Valiant's Complexity Classes. STACS 1998: 194-204 - 1997
- [b1]Peter Bürgisser, Michael Clausen, Mohammad Amin Shokrollahi:
Algebraic complexity theory. Grundlehren der mathematischen Wissenschaften 315, Springer 1997, ISBN 3-540-60582-7, pp. I-XXIII, 1-618 - 1993
- [j3]Peter Bürgisser, Marek Karpinski, Thomas Lickteig:
On Randomized Semi-algebraic Test Complexity. J. Complex. 9(2): 231-251 (1993) - 1992
- [j2]Peter Bürgisser, Thomas Lickteig, Michael Shub:
Test complexity of generic polynomials. J. Complex. 8(3): 203-215 (1992) - 1991
- [j1]Peter Bürgisser, Marek Karpinski, Thomas Lickteig:
Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication. Comput. Complex. 1: 131-155 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-16 19:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
