The University of Chicago Hariharan Narayanan MIT Milind Sohoni I.I.T. Bombay / University of Chicago / /
IndustryTerm
polynomial algorithm / polynomial time algorithms / interior point algorithm / Polynomial algorithms / Usual linear programming algorithms / simpler combinatorial algorithms / polynomial time algorithm / tensor product / polynomial-time algorithm / polynomial time combinatorial algorithm / max-flow algorithm / tensor products / combinatorial linear programming algorithm / /
Organization
University of Chicago Hariharan Narayanan MIT Milind Sohoni I.I.T. Bombay / The University of Chicago / National Science Foundation / University of Chicago / Computer Science Department / /
Person
Ketan D. Mulmuley / C. Tollu / /
Position
King / /
PublishedMedium
Journal of Algebraic Combinatorics / /
TVShow
Q.E.D. / /
Technology
combinatorial linear programming algorithm / discovery algorithm / CRM / polynomial time algorithm / polynomial time combinatorial algorithm / Usual linear programming algorithms / polynomial-time algorithm / interior point algorithm / simpler combinatorial algorithms / Polynomial algorithms / polynomial time algorithms / max-flow algorithm / polynomial algorithm / /
Geometric Complexity Theory III: On deciding nonvanishing of a Littlewood-Richardson coefficient Dedicated to Sri Ramakrishna Ketan D. Mulmuley ∗ The University of Chicago Hariharan Narayanan