The following pages link to Ketan D. Mulmuley (Q1686839):
Displayed 28 items.
- (Q230570) (redirect page) (← links)
- (Q1923859) (redirect page) (← links)
- On levels in arrangements and Voronoi diagrams (Q804321) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- Fully abstract submodels of typed lambda calculi (Q1095880) (← links)
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (Q1097640) (← links)
- A generalization of Dehn-Sommerville relations to simple stratified spaces (Q1196365) (← links)
- Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
- Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements (Q1317487) (← links)
- An efficient algorithm for hidden surface removal. II (Q1342857) (← links)
- On vanishing of Kronecker coefficients (Q1686840) (← links)
- Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
- A fast planar partition algorithm. I (Q2638830) (← links)
- Lower bounds for parallel linear programming and other problems (Q2817655) (← links)
- Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- On P vs. NP and geometric complexity theory (Q3016252) (← links)
- (Q3134498) (← links)
- (Q3336725) (← links)
- (Q3675549) (← links)
- (Q4230330) (← links)
- (Q4268453) (← links)
- Lower Bounds in a Parallel Model without Bit Operations (Q4268719) (← links)
- A fast planar partition algorithm, II (Q4302829) (← links)
- (Q4401024) (← links)
- (Q4526984) (← links)
- Boundaries of VP and VNP (Q4598170) (← links)
- (Q4945517) (← links)
- Membership in Moment Polytopes is in NP and coNP (Q5269822) (← links)
- A lower bound for the shortest path problem (Q5956014) (← links)