Ketan Mulmuley
- Matching is as easy as matrix inversion
1987/01/01 by Ketan Mulmuley, Umesh Vazirani, Vijay V. Vazirani · 15 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Optimization and Search Problems
- Lower Bounds in a Parallel Model without Bit Operations
1999/01/01 by Ketan Mulmuley · 1 voice · 3 citations
Computer Science · #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Polynomial and algebraic computation
- Geometric Complexity Theory II: Towards explicit obstructions for embeddings among class varieties
2006/12/25 by Ketan Mulmuley, Ketan D Mulmuley, Mulmuley, Ketan D +2 · 1 citation
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Commutative Algebra and Its Applications #Polynomial and algebraic computation #cs.CC #math.AG #math.RT
- Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients
2005/01/26 by Ketan Mulmuley, Ketan D. Mulmuley, Milind A. Sohoni +3 · 1 citation
Computer Science · Mathematics · #Advanced Algebra and Geometry #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #Computational Complexity (cs.CC) #F1.3 #FOS: Computer and information sciences #FOS: Mathematics #Representation Theory (math.RT) #cs.CC #math.RT
- Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem
2007/03/22 by Jonah Blasiak, Ketan Mulmuley, Ketan D. Mulmuley +4 · 1 citation
Computer Science · Mathematics · #Advanced Algebra and Geometry #Advanced Topics in Algebra #Algebraic structures and combinatorial models #Computational Complexity (cs.CC) #FOS: Computer and information sciences #cs.CC