62 citations · 193 across the 13 of their papers we have counts for
6 papers · 1 filter
On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view
Ketan D. Mulmuley
Geometric complexity theory (GCT) is an approach to the vs. and related problems through algebraic geometry and representation theory. This article gives a high-level expo…
Geometric Complexity Theory: Introduction
Ketan D. Mulmuley, Milind Sohoni
These are lectures notes for the introductory graduate courses on geometric complexity theory (GCT) in the computer science department, the university of Chicago. Part I consists o…
Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups
Ketan D. Mulmuley
This article gives conjecturally correct algorithms to construct canonical bases of the irreducible polynomial representations and the matrix coordinate rings of the nonstandard qu…
Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem
Ketan D. Mulmuley
This article describes a {\em nonstandard} quantum group that may be used to derive a positive formula for the plethysm problem, just as the standard (Drinfeld-Jimbo) quantum group…
Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry
Ketan D. Mulmuley
This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs. NP and related problems through algebraic geometry and representation theory. The ba…
Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem
Jonah Blasiak, Ketan D. Mulmuley, Milind Sohoni
The Kronecker coefficient g_{λμν} is the multiplicity of the GL(V)\times GL(W)-irreducible V_λ\otimes W_μin the restriction of the GL(X)-irreducible X_νvia the natural map GL(V)\ti…