filmov
tv
Geometric Complexity Theory: No Occurrence Obstructions for Determinant vs Permanent
Показать описание
Peter Bürgisser (Technical University of Berlin)
Algebraic Methods
Simons Institute
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
Рекомендации по теме
0:50:48
Geometric Complexity Theory: No Occurrence Obstructions for Determinant vs Permanent
0:46:35
Geometric Perspectives on Problems in Complexity Theory
1:00:05
Geometric Complexity Theory I: Complexity Lower Bounds...
1:06:59
Introduction to Geometric Complexity Theory by Christian Ikenmeyer
0:49:08
Kronecker and Plethysm Coefficients in Geometric Complexity Theory: ...
1:08:05
Introduction to Geometric Complexity Theory II
1:09:50
Geometric complexity theory (GCT): Algorithmic challenges in invariant theory - Ketan D. Mulmuley
0:49:43
Thomas Seiller: A geometric theory of algorithms
1:04:23
Geometric Complexity Theory II: Complexity Lower Bounds...
2:03:23
Geometric complexity theory from a combinatorial viewpoint - Greta Panova
0:43:28
Geometric Complexity Theory and Tensor Rank
0:21:54
Session 6B - Implementing geometric complexity theory
1:27:49
Tutorial 4: GCT and Matrix Multiplication
1:19:24
[GCT2022] Christian Ikenmeyer -- GCT - an overview.
1:07:35
STACS 2021 | Optimization, Complexity and Invariant Theory
0:29:26
On Geometric Measures for Information Complexity
1:08:42
[GCT2022] Christian Ikenmeyer - Implementing GCT: On the separation of orbit closures via symmetries
1:21:31
[GCT2022] Peter Bürgisser -- GCT: no occurrence obstructions for determinant vs permanent
0:47:50
Recent Progress on Representation Theoretic Multiplicities in GCT
1:10:45
On the possibility of an instance-based complexity theory - Boaz Barak
1:09:40
Wrap Session part 2
1:04:36
Geometry, Invariants, and the Elusive Search for Complexity Lower Bounds
0:42:04
STOC 2020 - Session 6B: Complexity I
0:54:21
Multiplicity obstructions are stronger than occurrence obstructions by Christian Ikenmeyer