15 citations · 47 across the 5 of their papers we have counts for
5 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 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 II: Towards explicit obstructions for embeddings among class varieties
Ketan D Mulmuley, Milind Sohoni
In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity clas…
Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients
Ketan D. Mulmuley, Milind Sohoni
We point out that the remarkable Knutson and Tao Saturation Theorem and polynomial time algorithms for LP have together an important and immediate consequence in Geometric Complexi…