62 citations · 193 across the 13 of their papers we have counts for
15 papers
Boundaries of VP and VNP
Joshua A. Grochow, Ketan D. Mulmuley, Youming Qiao
One fundamental question in the context of the geometric complexity theory approach to the VP vs. VNP conjecture is whether VP = , where VP is the class of…
Membership in moment polytopes is in NP and coNP
Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley +1
We show that the problem of deciding membership in the moment polytope associated with a finite-dimensional unitary representation of a compact, connected Lie group is in NP and co…
On vanishing of Kronecker coefficients
Christian Ikenmeyer, Ketan D. Mulmuley, Michael Walter
We show that the problem of deciding positivity of Kronecker coefficients is NP-hard. Previously, this problem was conjectured to be in P, just as for the Littlewood-Richardson coe…
Geometric Complexity Theory V: Efficient algorithms for Noether Normalization
Ketan D. Mulmuley
We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether's Normalization Lemma. For general explicit varietie…
Explicit Proofs and The Flip
Ketan Mulmuley
This article describes a formal strategy of geometric complexity theory (GCT) to resolve the {\em self referential paradox} in the vs. and related problems. The strategy,…
On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis
Ketan D. Mulmuley
Geometric complexity theory (GCT) is an approach to the vs. and related problems. A high level overview of this research plan and the results obtained so far was presented…