34 citations · 66 across the 14 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2007★ 8 cited
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…
cs.CC2006★ 1 cited
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…
cs.CC2005★ 15 cited
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…