Peter Bürgisser

Orcid: 0000-0001-8169-0514

Affiliations:
  • TU Berlin, Institute of Mathematics, Germany
  • University of Paderborn, Department of Mathematics, Germany


According to our database1, Peter Bürgisser authored at least 73 papers between 1991 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On the Hardness of PosSLP.
CoRR, 2023

Real zeros of mixed random fewnomial systems.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2021
Computing the Homology of Semialgebraic Sets. II: General Formulas.
Found. Comput. Math., 2021

Optimization, Complexity and Invariant Theory (Invited Talk).
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Polynomial Time Algorithms in Invariant Theory for Torus Actions.
Proceedings of the 36th Computational Complexity Conference, 2021

2020
The real tau-conjecture is true on average.
Random Struct. Algorithms, 2020

Computing the Homology of Semialgebraic Sets. I: Lax Formulas.
Found. Comput. Math., 2020

Correction To: The Complexity of Factors of Multivariate Polynomials.
Found. Comput. Math., 2020

Rigid continuation paths II. Structured polynomial systems.
CoRR, 2020

Interior-point methods for unconstrained geometric programming and scaling problems.
CoRR, 2020

2019
On the Number of Real Zeros of Random Fewnomials.
SIAM J. Appl. Algebra Geom., 2019

Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time.
J. ACM, 2019

Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes.
CoRR, 2019

Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Membership in Moment Polytopes is in NP and coNP.
SIAM J. Comput., 2017

Condition of Intersecting a Projective Variety with a Varying Linear Subspace.
SIAM J. Appl. Algebra Geom., 2017

On the condition of the zeros of characteristic polynomials.
J. Complex., 2017

2016
Condition Length and Complexity for the Solution of Polynomial Systems.
Found. Comput. Math., 2016

No Occurrence Obstructions in Geometric Complexity Theory.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Intrinsic volumes of symmetric cones and applications in convex programming.
Math. Program., 2015

Probabilistic Analysis of the Grassmann Condition Number.
Found. Comput. Math., 2015

Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242).
Dagstuhl Reports, 2015

Permanent versus determinant: not via saturations of monoids of representations.
CoRR, 2015

Fundamental invariants of orbit closures.
CoRR, 2015

Permanent versus determinant, obstructions, and Kronecker coefficients.
CoRR, 2015

Computing the Chow Variety of Quadratic Space Curves.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

2013
Deciding Positivity of Littlewood-Richardson Coefficients.
SIAM J. Discret. Math., 2013

Computational Counting (Dagstuhl Seminar 13031).
Dagstuhl Reports, 2013

Explicit lower bounds via geometric complexity theory.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Condition - The Geometry of Numerical Algorithms.
Grundlehren der mathematischen Wissenschaften 349, Springer, ISBN: 978-3-642-38895-8, 2013

2012
A Coordinate-Free Condition Number for Convex Programming.
SIAM J. Optim., 2012

Robust smoothed analysis of a condition number for linear programming.
Math. Program., 2012

Prospects for Geometric Complexity Theory.
Proceedings of the 27th Conference on Computational Complexity, 2012

2011
An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP.
SIAM J. Comput., 2011

Geometric complexity theory and tensor rank.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Probabilistic analysis of condition numbers.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010
Smoothed Analysis of Moore-Penrose Inversion.
SIAM J. Matrix Anal. Appl., 2010

Counting Irreducible Components of Complex Algebraic Varieties.
Comput. Complex., 2010

Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

10481 Executive Summary - Computational Counting.
Proceedings of the Computational Counting, 28.11. - 03.12.2010, 2010

10481 Abstracts Collection - Computational Counting.
Proceedings of the Computational Counting, 28.11. - 03.12.2010, 2010

2009
On the complexity of counting components of algebraic varieties.
J. Symb. Comput., 2009

Exotic Quantifiers, Complexity Classes, and Complete Problems.
Found. Comput. Math., 2009

An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP
CoRR, 2009

On Defining Integers And Proving Arithmetic Circuit Lower Bounds.
Comput. Complex., 2009

2008
The probability that a slightly perturbed numerical analysis problem is difficult.
Math. Comput., 2008

Guest Editor's Preface.
J. Complex., 2008

2007
The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties.
Found. Comput. Math., 2007

On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds.
Proceedings of the STACS 2007, 2007

Differential forms in computational algebraic geometry.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets.
J. Complex., 2006

On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity.
Electron. Colloquium Comput. Complex., 2006

The complexity of semilinear problems in succinct representation.
Comput. Complex., 2006

2005
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets.
Found. Comput. Math., 2005

On the Complexity of Numerical Analysis
Electron. Colloquium Comput. Complex., 2005

2004
Lower bounds on the bounded coefficient complexity of bilinear maps.
J. ACM, 2004

The Complexity of Factors of Multivariate Polynomials.
Found. Comput. Math., 2004

2003
Counting Complexity Classes for Numeric Computations I: Semilinear Sets.
SIAM J. Comput., 2003

Counting Complexity Classes over the Reals I: The Additive Case.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2001
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Lower Bounds and Real Algebraic Geometry.
Proceedings of the Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, 2001

2000
Cook's versus Valiant's hypothesis.
Theor. Comput. Sci., 2000

The Computational Complexity of Immanants.
SIAM J. Comput., 2000

The Computational Complexity to Evaluate Representations of General Linear Groups.
SIAM J. Comput., 2000

Completeness and Reduction in Algebraic Complexity Theory.
Algorithms and computation in mathematics 7, Springer, ISBN: 978-3-540-66752-0, 2000

1999
On the Structure of Valiant's Complexity Classes.
Discret. Math. Theor. Comput. Sci., 1999

1998
On the Parallel Complexity of the Polynomial Ideal Membership Problem.
J. Complex., 1998

1997
Algebraic complexity theory.
Grundlehren der mathematischen Wissenschaften 315, Springer, ISBN: 3-540-60582-7, 1997

1993
On Randomized Semi-algebraic Test Complexity.
J. Complex., 1993

1992
Test complexity of generic polynomials.
J. Complex., 1992

1991
Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication.
Comput. Complex., 1991


  Loading...