Geometric Complexity Theory: No Occurrence Obstructions for Determinant vs Permanent
622 views · Published 4 December 2018 · 50:48 · Indexed 26 September 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
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
29:08
An Isomorphism Between Parameterized Complexity and Classical Complexity, for both Time and Space
-
33:14
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
-
45:30
Informational Substitutes and Complements for Prediction
-
23:27
Which Regular Expression Patterns are Hard to Match?
-
1:03:10
Decay of Correlations in Spin Systems
-
55:50
Approximate Counting II