Geometric Complexity Theory: No Occurrence Obstructions for Determinant vs Permanent
624 views · Published 4 December 2018 · 50:48 · Indexed 18 October 2026
Channel: Simons Institute for the Theory of Computing · 2018 · Education
Peter Bürgisser (Technical University of Berlin) https://simons.berkeley.edu/talks/geometric-complexity-theory-no-occurrence-obstructions-determinant-vs-permanent Algebraic Methods
More from this channel
-
35:16
Probabilistic Polynomials and Hamming Nearest Neighbors
-
15:16
Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
-
55:22
Thinking Algorithmically About Impossibility
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
33:01
Revenue Maximization in Interdependent Value Settings
-
34:31
Algorithmic Bayesian Mechanism Design
-
37:51
On Maximizing Revenue for Multi-Item Auctions