Ketan Mulmuley
- Professor
- Department of Computer Science
- Professor
- Physical Sciences Collegiate Division
Contact Information
University of Chicago
1100 E 58th Street
Chicago, IL 60637
Office:
Phone: (773)702-1270
Fax: (773)702-8487
mulmuley@cs.uchicago.edu
Personal Homepage
http://ramakrishnadas.cs.uchicago.edu
Research
Current work: Developing an approach to P vs. NP and related problems through algebraic geometry and representation theory (Geometric complexity theory)Please see papers at http://ramakrishnadas.cs.uchicago.edu
List of Publications
Available in HTML.
Technical Reports
- TR-2008-10
- Erratum to the saturation hypothesis (SH) in "Geometric Complexity Theory". Ketan Mulmuley. 29 October, 2008. Communicated by Ketan Mulmuley.
- TR-2007-16
- Geometric Complexity Theory: Introduction. Milind Sohoni; Ketan D. Mulmuley. 4 September, 2007. Communicated by Ketan Mulmuley.
- TR-2007-15
- Geometric Complexity Theory: On canonical bases for the nonstandard quantum groups. Ketan D. Mulmuley. 4 September, 2007. Communicated by Ketan Mulmuley.
- TR-2007-14
- Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem. Ketan D. Mulmuley. 4 September, 2007. Communicated by Ketan Mulmuley.
- TR-2007-13
- On P vs. NP, Geometric Complexity Theory, and The Flip I: a high-level view. Ketan D. Mulmuley. 4 September, 2007. Communicated by Ketan Mulmuley.
- TR-2007-12
- Geometric Complexity Theory: Abstract. Ketan D. Mulmuley. 4 September, 2007. Communicated by Ketan Mulmuley.
- TR-2007-09
- On P vs. NP, Geometric Complexity Theory, and The Flip I: a high-level view. Ketan D. Mulmuley. 1 July, 2007. Communicated by Ketan Mulmuley.
- TR-2007-05
- Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient. Hariharan Narayanan; Ketan D. Mulmuley. 18 May, 2007. Communicated by Ketan Mulmuley.
- TR-2007-04
- Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry. Ketan D. Mulmuley. 18 May, 2007. Communicated by Ketan Mulmuley.
- TR-2000-02
- A Lower Bound on Computing Blocking Flows in Graphs. Pradyut Shah; Ketan Mulmuley. 1 November, 2000. Communicated by Ketan Mulmuley.
- TR-91-07
- A simple online algorithm for constructing Voronoi diagrams. Mulmuley, Ketan. 25 February, 1991. Communicated by Ketan Mulmuley.
- TR-90-31
- An Efficient Algorithm for Hidden Surface Removal II. Mulmuley, Ketan. 30 October, 1990. Communicated by Ketan Mulmuley.
- TR-90-25
- View Dependent Partitions. Mulmuley, Ketan. 21 August, 1990. Communicated by Ketan Mulmuley.
- TR-90-24
- A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces. Mulmuley, Ketan. 21 August, 1990. Communicated by Ketan Mulmuley.
- TR-90-23
- On levels in arrangements and Voronoi diagrams, II: output sensitive and dynamic constructions. Mulmuley, Ketan. 21 August, 1990. Communicated by Ketan Mulmuley.