default search action
Ketan Mulmuley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j19]Christian Ikenmeyer, Ketan D. Mulmuley, Michael Walter
:
On vanishing of Kronecker coefficients. Comput. Complex. 26(4): 949-992 (2017) - [j18]Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley, Michael Walter
Membership in Moment Polytopes is in NP and coNP. SIAM J. Comput. 46(3): 972-991 (2017) - 2016
- [c25]Joshua A. Grochow, Ketan D. Mulmuley, Youming Qiao
Boundaries of VP and VNP. ICALP 2016: 34:1-34:14 - [i15]Joshua A. Grochow, Ketan D. Mulmuley, Youming Qiao:
Boundaries of VP and VNP. CoRR abs/1605.02815 (2016) - 2015
- [i14]Christian Ikenmeyer, Ketan D. Mulmuley, Michael Walter:
On vanishing of Kronecker coefficients. CoRR abs/1507.02955 (2015) - [i13]Peter Bürgisser, Matthias Christandl, Ketan D. Mulmuley, Michael Walter:
Membership in moment polytopes is in NP and coNP. CoRR abs/1511.03675 (2015) - 2012
- [j17]Ketan Mulmuley:
The GCT program toward the P vs. NP problem. Commun. ACM 55(6): 98-107 (2012) - [c24]Ketan Mulmuley:
Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma. FOCS 2012: 629-638 - [i12]Ketan Mulmuley:
Geometric Complexity Theory V: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of Noether's Normalization Lemma. CoRR abs/1209.5993 (2012) - 2011
- [j16]Ketan Mulmuley:
On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna. J. ACM 58(2): 5:1-5:26 (2011) - 2010
- [i11]Ketan Mulmuley:
Explicit Proofs and The Flip. CoRR abs/1009.0246 (2010)
2000 – 2009
- 2009
- [i10]Ketan Mulmuley:
On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier. CoRR abs/0908.1932 (2009) - [i9]Ketan Mulmuley:
On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis. CoRR abs/0908.1936 (2009) - 2008
- [j15]Ketan Mulmuley, Milind A. Sohoni:
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties. SIAM J. Comput. 38(3): 1175-1206 (2008) - 2007
- [i8]Ketan Mulmuley:
Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry. CoRR abs/0704.0229 (2007) - [i7]Ketan Mulmuley, Milind A. Sohoni:
Geometric Complexity Theory: Introduction. CoRR abs/0709.0746 (2007) - [i6]Ketan Mulmuley:
On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view. CoRR abs/0709.0748 (2007) - [i5]Ketan Mulmuley:
Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem. CoRR abs/0709.0749 (2007) - [i4]Ketan Mulmuley:
Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups. CoRR abs/0709.0751 (2007) - [i3]Ketan Mulmuley, Milind A. Sohoni:
Geometric Complexity Theory IV: quantum group for the Kronecker problem. CoRR abs/cs/0703110 (2007) - 2006
- [i2]Ketan Mulmuley, Milind A. Sohoni:
Geometric Complexity Theory II: Towards explicit obstructions for embeddings among class varieties. CoRR abs/cs/0612134 (2006) - 2005
- [i1]Ketan Mulmuley, Milind A. Sohoni:
Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients. CoRR abs/cs/0501076 (2005) - 2004
- [r1]Otfried Cheong, Ketan Mulmuley, Edgar Ramos:
Randomization and derandomization. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 895-926 - 2001
- [j14]Ketan Mulmuley, Pradyut Shah:
A Lower Bound for the Shortest Path Problem. J. Comput. Syst. Sci. 63(2): 253-267 (2001) - [j13]Ketan Mulmuley, Milind A. Sohoni:
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems. SIAM J. Comput. 31(2): 496-526 (2001) - 2000
- [c23]Ketan Mulmuley, Pradyut Shah:
A Lower Bound for the Shortest Path Problem. CCC 2000: 14-21 - [p1]Ketan Mulmuley:
Randomized Algorithms in Computational Geometry. Handbook of Computational Geometry 2000: 703-724
1990 – 1999
- 1999
- [j12]Ketan Mulmuley:
Lower Bounds in a Parallel Model without Bit Operations. SIAM J. Comput. 28(4): 1460-1509 (1999) - 1997
- [c22]Ketan Mulmuley:
Is There an Algebraic Proof for P != NC? (Extended Abstract). STOC 1997: 210-219 - [c21]Ketan Mulmuley:
Parallel vs. Parametric Complexity (Abstract). WADS 1997: 282-283 - 1996
- [j11]Ketan Mulmuley:
Randomized Geometric Algorithms and Pseudorandom Generators. Algorithmica 16(4/5): 450-463 (1996) - 1994
- [b1]Ketan Mulmuley:
Computational geometry - an introduction through randomized algorithms. Prentice Hall 1994, ISBN 978-0-13-336363-0, pp. I-XV, 1-447 - [j10]Ketan Mulmuley:
An Efficient Algorithm for Hidden Surface Removal, II. J. Comput. Syst. Sci. 49(3): 427-453 (1994) - [c20]Ketan Mulmuley:
Lower bounds for parallel linear programming and other problems. STOC 1994: 603-614 - [c19]Ketan Mulmuley:
Randomized Geometric Algorithms (Abstract). SWAT 1994: 252-254 - 1993
- [j9]Ketan Mulmuley:
A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces. Discret. Comput. Geom. 9: 47-55 (1993) - [j8]Ketan Mulmuley:
Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements. J. Comput. Syst. Sci. 47(3): 437-458 (1993) - [c18]Ketan Mulmuley:
Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in Arrangements. SCG 1993: 240-246 - [c17]Ketan Mulmuley:
A lOwer Bound for Solvability of Polynomial Equations. FSTTCS 1993: 268-283 - 1992
- [j7]Ketan Mulmuley, Sandeep Sen:
Dynamic Point Location in Arrangement of Hyperplanes. Discret. Comput. Geom. 8: 335-360 (1992) - [c16]Ketan Mulmuley:
Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract). FOCS 1992: 90-100 - 1991
- [j6]Ketan Mulmuley:
On Levels in Arrangement and Voronoi Diagrams. Discret. Comput. Geom. 6: 307-338 (1991) - [j5]Ketan Mulmuley:
A Fast Planar Partition Algorithm, II. J. ACM 38(1): 74-103 (1991) - [c15]Ketan Mulmuley:
A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces. SCG 1991: 115-120 - [c14]Ketan Mulmuley:
Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract). SCG 1991: 121-131 - [c13]Ketan Mulmuley, Sandeep Sen:
Dynamic Point Location in Arrangements of Hyperplanes. SCG 1991: 132-141 - [c12]Ketan Mulmuley:
Randomized Multidimensional Search Trees: Lazy Balancing and Dynamic Shuffling (Extended Abstract). FOCS 1991: 180-196 - [c11]Ketan Mulmuley:
Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended Abstract). FOCS 1991: 216-227 - [c10]Ketan Mulmuley:
Hidden Surface Removal with Respect to a Moving View Point. STOC 1991: 512-522 - 1990
- [j4]Ketan Mulmuley:
A Fast Planar Partition Algorithm, I. J. Symb. Comput. 10(3/4): 253-280 (1990) - [c9]Ketan Mulmuley:
Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to k. STOC 1990: 322-330
1980 – 1989
- 1989
- [c8]Ketan Mulmuley:
A Fast Planar Partition Algorithm, II. SCG 1989: 33-43 - [c7]Ketan Mulmuley:
On Obstructions in Relation to a Fixed Viewpoint. FOCS 1989: 592-597 - [c6]Ketan Mulmuley:
An efficient algorithm for hidden surface removal. SIGGRAPH 1989: 379-388 - 1988
- [c5]Ketan Mulmuley:
A Fast Planar Partition Algorithm, I (Extended Abstract). FOCS 1988: 580-589 - 1987
- [j3]Ketan Mulmuley:
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Comb. 7(1): 101-104 (1987) - [j2]Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani:
Matching is as easy as matrix inversion. Comb. 7(1): 105-113 (1987) - [c4]Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani:
Matching Is as Easy as Matrix Inversion. STOC 1987: 345-354 - 1986
- [j1]Ketan Mulmuley:
Fully Abstract Submodels of Typed Lambda Calculi. J. Comput. Syst. Sci. 33(1): 2-46 (1986) - [c3]Ketan Mulmuley:
A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field. STOC 1986: 338-339 - 1984
- [c2]Ketan Mulmuley:
The Mechanization of Existence Proofs of Recursive Predicates. CADE 1984: 460-475 - [c1]Ketan Mulmuley:
A Semantic Characterization of Full Abstraction for Typed Lambda Calculi. FOCS 1984: 279-288
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: