A lower bound for the shortest path problem
Mulmuley, K., Shah, P.
Published in Proceedings / IEEE Conference on Computational Complexity (2000)
Published in Proceedings / IEEE Conference on Computational Complexity (2000)
Get full text
Conference Proceeding
Journal Article
Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma
Mulmuley, K. D.
Published in 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (01.10.2012)
Published in 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (01.10.2012)
Get full text
Conference Proceeding
Output sensitive and dynamic constructions of higher order voronoi diagrams and levels in arrangements
Get full text
Journal Article
Conference Proceeding
Matching is as easy as matrix inversion
MULMULEY, K, VAZIRANI, U. V, VAZIRANI, V. V
Published in Combinatorica (Budapest. 1981) (01.03.1987)
Published in Combinatorica (Budapest. 1981) (01.03.1987)
Get full text
Journal Article
A fast planar partition algorithm. I
Mulmuley, K.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
Randomized geometric algorithms and pseudo-random generators
Mulmuley, K.
Published in Proceedings., 33rd Annual Symposium on Foundations of Computer Science (1992)
Published in Proceedings., 33rd Annual Symposium on Foundations of Computer Science (1992)
Get full text
Conference Proceeding