Ketan Mulmuley

According to our database, Ketan Mulmuley authored at least 52 papers between 1984 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

Membership in Moment Polytopes is in NP and coNP.

Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley, Michael Walter

SIAM J. Comput., 2017

On vanishing of Kronecker coefficients.

Christian Ikenmeyer, Ketan D. Mulmuley, Michael Walter

Comput. Complex., 2017

2016

Boundaries of VP and VNP.

Joshua A. Grochow, Ketan D. Mulmuley, Youming Qiao

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2012

The GCT program toward the <i>P</i> vs. <i>NP</i> problem.

Ketan Mulmuley

Commun. ACM, 2012

Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma.

Ketan Mulmuley

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna.

Ketan Mulmuley

J. ACM, 2011

2010

Explicit Proofs and The Flip

Ketan Mulmuley

CoRR, 2010

2009

On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis

Ketan Mulmuley

CoRR, 2009

On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier

Ketan Mulmuley

CoRR, 2009

2008

Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties.

Ketan Mulmuley, Milind A. Sohoni

SIAM J. Comput., 2008

2007

Geometric Complexity Theory IV: quantum group for the Kronecker problem

Ketan Mulmuley, Milind A. Sohoni

CoRR, 2007

Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups

Ketan Mulmuley

CoRR, 2007

Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem

Ketan Mulmuley

CoRR, 2007

On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view

Ketan Mulmuley

CoRR, 2007

Geometric Complexity Theory: Introduction

Ketan Mulmuley, Milind A. Sohoni

CoRR, 2007

Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry

Ketan Mulmuley

CoRR, 2007

2005

Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients

Ketan Mulmuley, Milind A. Sohoni

CoRR, 2005

2004

Randomization and derandomization.

Otfried Cheong, Ketan Mulmuley, Edgar Ramos

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2001

Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems.

Ketan Mulmuley, Milind A. Sohoni

SIAM J. Comput., 2001

A Lower Bound for the Shortest Path Problem.

Ketan Mulmuley, Pradyut Shah

J. Comput. Syst. Sci., 2001

2000

Randomized Algorithms in Computational Geometry.

Ketan Mulmuley

Proceedings of the Handbook of Computational Geometry, 2000

1999

Lower Bounds in a Parallel Model without Bit Operations.

Ketan Mulmuley

SIAM J. Comput., 1999

1997

Parallel vs. Parametric Complexity (Abstract).

Ketan Mulmuley

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Is There an Algebraic Proof for <i>P != NC</i>? (Extended Abstract).

Ketan Mulmuley

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Randomized Geometric Algorithms and Pseudorandom Generators.

Ketan Mulmuley

Algorithmica, 1996

1994

An Efficient Algorithm for Hidden Surface Removal, II.

Ketan Mulmuley

J. Comput. Syst. Sci., 1994

Randomized Geometric Algorithms (Abstract).

Ketan Mulmuley

Proceedings of the Algorithm Theory, 1994

Lower bounds for parallel linear programming and other problems.

Ketan Mulmuley

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Computational geometry - an introduction through randomized algorithms.

Ketan Mulmuley

Prentice Hall, ISBN: 978-0-13-336363-0, 1994

1993

Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements.

Ketan Mulmuley

J. Comput. Syst. Sci., 1993

A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces.

Ketan Mulmuley

Discret. Comput. Geom., 1993

A lOwer Bound for Solvability of Polynomial Equations.

Ketan Mulmuley

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in Arrangements.

Ketan Mulmuley

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992

Dynamic Point Location in Arrangement of Hyperplanes.

Ketan Mulmuley, Sandeep Sen

Discret. Comput. Geom., 1992

Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract)

Ketan Mulmuley

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

A Fast Planar Partition Algorithm, II.

Ketan Mulmuley

J. ACM, 1991

On Levels in Arrangement and Voronoi Diagrams.

Ketan Mulmuley

Discret. Comput. Geom., 1991

Hidden Surface Removal with Respect to a Moving View Point

Ketan Mulmuley

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended Abstract)

Ketan Mulmuley

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Randomized Multidimensional Search Trees: Lazy Balancing and Dynamic Shuffling (Extended Abstract)

Ketan Mulmuley

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Dynamic Point Location in Arrangements of Hyperplanes.

Ketan Mulmuley, Sandeep Sen

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract).

Ketan Mulmuley

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

A Fast Planar Partition Algorithm, I.

Ketan Mulmuley

J. Symb. Comput., 1990

Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to k

Ketan Mulmuley

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989

An efficient algorithm for hidden surface removal.

Ketan Mulmuley

Proceedings of the 16th Annual Conference on Computer Graphics and Interactive Techniques, 1989

On Obstructions in Relation to a Fixed Viewpoint

Ketan Mulmuley

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

A Fast Planar Partition Algorithm, I (Extended Abstract)

Ketan Mulmuley

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987

Matching is as easy as matrix inversion.

Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani

Comb., 1987

A fast parallel algorithm to compute the rank of a matrix over an arbitrary field.

Ketan Mulmuley

Comb., 1987

1986

Fully Abstract Submodels of Typed Lambda Calculi.

Ketan Mulmuley

J. Comput. Syst. Sci., 1986

1984

A Semantic Characterization of Full Abstraction for Typed Lambda Calculi

Ketan Mulmuley

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

The Mechanization of Existence Proofs of Recursive Predicates.

Ketan Mulmuley

Proceedings of the 7th International Conference on Automated Deduction, 1984