Peter Bürgisser

Q: What Schools Are Affiliated With Peter Bürgisser

Peter Bürgisser is affiliated with the following schools: University of Konstanz, Paderborn University, Technical University of Berlin

Peter Bürgisser's AcademicInfluence.com Rankings

Peter Bürgisser

Computer Science

#6954

World Rank

#7322

Historical Rank

Theoretical Computer Science

#142

World Rank

#142

Historical Rank

computer-science Degrees

Peter Bürgisser

Mathematics

#5240

World Rank

#7392

Historical Rank

Algebraic Geometry

#210

World Rank

#218

Historical Rank

Measure Theory

#3567

World Rank

#4208

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Peter Bürgisser's Degrees

PhD Mathematics Paderborn University

Why Is Peter Bürgisser Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Peter Bürgisser is a Swiss mathematician and theoretical computer scientist who deals with algorithmic algebra and algebraic complexity theory. Education and career Bürgisser received in 1990 his doctorate from the University of Konstanz with thesis Degenerationsordnung und Trägerfunktional bilinearer Abbildungen under the supervision of Volker Strassen. Bürgisser was a postdoc at the University of Bonn from 1991 to 1993 and then at the University of Zürich. He was a professor at the University of Paderborn and since 2013 a professor at the Technical University of Berlin .

(See a Problem?)

Peter Bürgisser's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Algebraic complexity theory (1997) (813)
Completeness and Reduction in Algebraic Complexity Theory (2000) (202)
On the complexity of numerical analysis (2006) (173)
Condition - The Geometry of Numerical Algorithms (2013) (157)
An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP (2009) (107)
Algebraic Complexity Theory : With the Collaboration of Thomas Lickteig (1997) (80)
Geometric complexity theory and tensor rank (2010) (64)
The complexity of computing Kronecker coefficients (2008) (60)
Cook's versus Valiant's hypothesis (2000) (59)
No Occurrence Obstructions in Geometric Complexity Theory (2016) (57)
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets (2003) (56)
The Complexity of Factors of Multivariate Polynomials (2001) (50)
Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes (2019) (48)
Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory (2017) (47)
Explicit lower bounds via geometric complexity theory (2012) (46)
Typical Tensorial Rank (1997) (46)
Incorporating severity variations into credit risk (2001) (37)
Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time (2017) (36)
On Defining Integers And Proving Arithmetic Circuit Lower Bounds (2009) (35)
On the Structure of Valiant's Complexity Classes (1998) (33)
Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes (2018) (33)
Deciding Positivity of Littlewood-Richardson Coefficients (2012) (32)
Average euler characteristic of random real algebraic varieties (2007) (32)
Probabilistic Schubert calculus (2016) (29)
Intrinsic volumes of symmetric cones and applications in convex programming (2015) (27)
Integrating Correlations (1999) (27)
The Computational Complexity of Immanants (2000) (26)
Probabilistic Analysis of the Grassmann Condition Number (2011) (26)
Exotic Quantifiers, Complexity Classes, and Complete Problems (2007) (25)
A Coordinate-Free Condition Number for Convex Programming (2011) (25)
Variations by complexity theorists on three themes of Euler , Bézout , Betti , and Poincaré (2004) (23)
Smoothed Analysis of Moore-Penrose Inversion (2010) (22)
Test complexity of generic polynomials (1992) (21)
Lower bounds on the bounded coefficient complexity of bilinear maps (2002) (20)
Fundamental invariants of orbit closures (2015) (20)
Smoothed Analysis of Condition Numbers (2011) (19)
Computing the Homology of Semialgebraic Sets. I: Lax Formulas (2018) (19)
Membership in Moment Polytopes is in NP and coNP (2015) (19)
On the complexity of counting components of algebraic varieties (2009) (17)
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets (2005) (17)
The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties (2005) (17)
On Randomized Semi-algebraic Test Complexity (1993) (17)
Permanent versus determinant: not via saturations of monoids of representations (2015) (16)
Condition Length and Complexity for the Solution of Polynomial Systems (2015) (14)
The Computational Complexity to Evaluate Representations of General Linear Groups (2000) (14)
Counting Complexity Classes for Numeric Computations I: Semilinear Sets (2003) (13)
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity (2001) (13)
Robust smoothed analysis of a condition number for linear programming (2008) (12)
A max-flow algorithm for positivity of Littlewood-Richardson coefficients (2009) (12)
The Complexity of Immanants (2000) (11)
The complexity of semilinear problems in succinct representation (2005) (11)
Computing the Homology of Semialgebraic Sets. II: General Formulas (2019) (10)
General formulas for the smoothed analysis of condition numbers (2006) (10)
Condition of Intersecting a Projective Variety with a Varying Linear Subspace (2015) (10)
Interior-point methods for unconstrained geometric programming and scaling problems (2020) (9)
Average volume, curvatures, and Euler characteristic of random real algebraic varieties (2006) (8)
Differential forms in computational algebraic geometry (2007) (8)
Lower Bounds and Real Algebraic Geometry (2001) (8)
Prospects for Geometric Complexity Theory (2012) (7)
On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity (2006) (7)
The real tau‐conjecture is true on average (2018) (6)
Verification complexity of linear prime ideals (1992) (6)
The complexity to compute the Euler characteristic of complex varieties (2004) (6)
Rigid continuation paths II. structured polynomial systems (2020) (5)
Counting Irreducible Components of Complex Algebraic Varieties (2010) (5)
On the condition of the zeros of characteristic polynomials (2017) (4)
Correction To: The Complexity of Factors of Multivariate Polynomials (2020) (3)
Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem (2010) (3)
Homotopy Continuation and Newton’s Method (2013) (3)
Computing the Chow Variety of Quadratic Space Curves (2015) (3)
Permanent versus determinant, obstructions, and Kronecker coefficients (2015) (3)
On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds (2007) (2)
N A ] 9 O ct 2 00 6 The probability that a small perturbation of a numerical analysis problem is difficult (2021) (2)
How applying Myhill Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding (2)
Uniform Smoothed Analysis of a Condition Number for Linear Programming (2008) (2)
Real Polynomial Systems (2013) (2)
Counting Complexity Classes over the Reals I: The Additive Case (2003) (1)
Problems Related to Matrix Multiplication (1997) (1)
1 Smoothed Analysis of Condition Numbers (2008) (1)
Computing the Homology of Semialgebraic Sets. II: General Formulas (2021) (1)
Some computational problems in linear algebra as hard as matrix multiplication (2005) (1)
Valiant’s Algebraic Model of NP-Completeness (2000) (1)
Permanent versus Determinant: Not via Saturations ; Permanent versus Determinant: {N}ot via Saturations (2017) (1)
Models of Computation (1997) (1)
On the Parallel Complexity of the Polynomial Ideal Membership Problem (1998) (1)
Condition Numbers and Iterative Algorithms (2013) (1)
Lower Bounds for the Complexity of Algebras (1997) (0)
Some Complete Families of Polynomials (2000) (0)
Probabilistic Analysis of Rectangular Matrices (2013) (0)
The Ellipsoid Method (2013) (0)
Preconditioning and Transcendence Degree (1997) (0)
Robust smoothed analysis of a condition number for linear programming (2010) (0)
Efficient Polynomial Arithmetic (1997) (0)
A Geometric Framework for Condition Numbers (2013) (0)
The Degree Bound (1997) (0)
Computing the Homology of Semialgebraic Sets. I: Lax Formulas (2019) (0)
The complexity of computing the Hilbert polynomial of smooth complex projective varieties (2004) (0)
Interior-Point Methods (2013) (0)
A G ] 1 D ec 2 01 5 Fundamental invariants of orbit closures (2018) (0)
10481 Abstracts Collection - Computational Counting (2010) (0)
Complexity Theory (2019) (0)
Computational Counting (Dagstuhl Seminar 13031) (2013) (0)
Condition Length and Complexity for the Solution of Polynomial Systems (2016) (0)
Condition and Linear Programming Optimization (2013) (0)
Smale’s 17th Problem: II (2013) (0)
Multiplicative and Bilinear Complexity (1997) (0)
Fast Evaluation of Representations of General Linear Groups (2000) (0)
Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242) (2015) (0)
Optimization, Complexity and Invariant Theory (2021) (0)
10481 Executive Summary - Computational Counting (2010) (0)
Linear Programs and Their Solution Sets (2013) (0)
Rank over Finite Fields and Codes (1997) (0)
Homogeneous Polynomial Systems (2013) (0)
Probabilistic Analyses of the GCC Condition Number (2013) (0)
Probabilistic Analysis of the Grassmann Condition Number (2013) (0)
Polynomial time algorithms in invariant theory for torus actions (2021) (0)
Average Analysis of the RCC Condition Number (2013) (0)
Intrinsic volumes of symmetric cones and applications in convex programming (2014) (0)
Optimization, Complexity and Invariant Theory (Invited Talk) (2021) (0)
The Substitution Method (1997) (0)
N A ] 2 3 N ov 2 01 5 On the condition of characteristic polynomials (2018) (0)
Probabilistic Analysis of Conic Condition Numbers: I. The Complex Case (2013) (0)
Branching and Connectivity (1997) (0)
J an 2 01 1 AN OVERVIEW OF MATHEMATICAL ISSUES ARISING IN THE GEOMETRIC COMPLEXITY THEORY APPROACH TO VP (2021) (0)
Branching and Degree (1997) (0)
The Linear Programming Feasibility Problem (2013) (0)
A Condition Number for Polyhedral Conic Systems (2013) (0)
Optimal Complexity Lower Bound for Polynomial Multiplication (2003) (0)
Error Analysis of Triangular Linear Systems (2013) (0)
P Versus NP: A Nonuniform Algebraic Analogue (1997) (0)
Probabilistic analysis of condition numbers (2011) (0)
Specific Polynomials which Are Hard to Compute (1997) (0)
Separation Results and Future Directions (2000) (0)
Rank of 2-Slice and 3-Slice Tensors (1997) (0)
Explicit Lower Bounds via Geometric Complexity Theory (Extended Abstract) (2012) (0)
Normwise Condition of Linear Equation Solving (2013) (0)
Probabilistic Analysis of Conic Condition Numbers: II. The Real Case (2013) (0)
Asymptotic Complexity of Matrix Multiplication (1997) (0)
Efficient Algorithms with Branching (1997) (0)

This paper list is powered by the following services:

Other Resources About Peter Bürgisser

What Schools Are Affiliated With Peter Bürgisser?

Peter Bürgisser is affiliated with the following schools:

Peter Bürgisser's Academic­Influence.com Rankings

Peter Bürgisser's Degrees

Why Is Peter Bürgisser Influential?

Peter Bürgisser's Published Works

Published Works

Other Resources About Peter Bürgisser

What Schools Are Affiliated With Peter Bürgisser?

Peter Bürgisser's AcademicInfluence.com Rankings