15 citations · 16 across the 2 of their papers we have counts for
2 papers
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…