Geometric complexity theory from a combinatorial viewpoint - Greta Panova
Kronecker and Plethysm Coefficients in Geometric Complexity Theory: ...
Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman
What Are Combinatorial Algorithms? | Richard Karp and Lex Fridman
The Art of Counting: A 2003 Lecture on Geometric Enumeration by Prof. Louis Billera
Algebraic combinatorics: applications to statistical mechanics and complexity theory - Greta Panova
The Kronecker Coefficients Of The Symmetric Group In Complexity And Combinatorics
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory
Geometric Complexity Theory: No Occurrence Obstructions for Determinant vs Permanent
[GCT2022] Joshua Grochow -- On GCT, part 2: characterization by symmetries, natural proofs, P vs NP
Greta Panova - Tuesday, May 17
Geometric Complexity Theory and Tensor Rank
Session 6B - Implementing geometric complexity theory
[GCT2022] Greta Panova -- Kronecker and plethysm coefficients in GCT
Computational Complexity in Algebraic Combinatorics by Greta Panova
Introduction to Geometric Complexity Theory II
[PNW-IP] The Kronecker and Littlewood-Richardson Coefficients
1630 Adam Brown Complexity and geometry
The Computational Complexity of Plethysm Coefficients
Panova: Symmetric Group Characters are Computationally Hard - FPSAC 2023
![[GCT2022] Joshua Grochow -- On GCT, part 2: characterization by symmetries, natural proofs, P vs NP](https://img.youtube.com/vi/lhBEiobmUs8/0.jpg)
![[GCT2022] Greta Panova -- Kronecker and plethysm coefficients in GCT](https://img.youtube.com/vi/tVmXqalMjWQ/0.jpg)
![[PNW-IP] The Kronecker and Littlewood-Richardson Coefficients](https://img.youtube.com/vi/3-SjKF712kE/0.jpg)
