15 citations · 47 across the 5 of their papers we have counts for
Showing 2007Show all
3 papers · 1 filter
cs.CC2007★ 5 cited
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…
cs.CC2007★ 11 cited
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…
cs.CC2007★ 15 cited
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…