Peter Bürgisser: Condition: the geometry of numerical algorithms - Lecture 1
Peter Bürgisser: Condition: the geometry of numerical algorithms - Lecture 2
Condition
Peter Bürgisser: "Towards a Theory of Non-commutative Optimization: Geodesic 1st & 2nd Order Met..."
Solving Polynomial Equations in Smoothed Polynomial Time
Geometry, Invariants, and the Elusive Search for Complexity Lower Bounds
[GCT2022] Peter Bürgisser -- GCT: no occurrence obstructions for determinant vs permanent
Peter Bürgisser - Complexity of computing complex zeros of structured polynomial systems
Tutorial 4: GCT and Matrix Multiplication
Symposium 2021: New Developments in Momentum Polytope Theory - Peter Bürgisser
Greg Reid: Numerical Differential-Geometric Algorithms in Computational Discovery
Geometric Complexity Theory: No Occurrence Obstructions for Determinant vs Permanent
STACS 2021 | Optimization, Complexity and Invariant Theory
Mathematics for Chemists, Lecture 9 - Numerical optimisation
GACT 2016: Vladimir Vaskevich - Errors, condition numbers and guaranteed accuracy...
Peter Buergisser
An Introduction to Numerical Algorithms (2019)
Shape analysis, lecture 2: Numerical tools for geometry
The Blundon Lecture with Dr. Peter Selinger
Weinan E: "High Dimensional PDEs: Theory and Numerical Algorithms"
![[GCT2022] Peter Bürgisser -- GCT: no occurrence obstructions for determinant vs permanent](https://img.youtube.com/vi/m8cn5Dr4C1Q/0.jpg)
