The following pages link to Nisheeth K. Vishnoi (Q430833):
Displaying 17 items.
- Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- The mixing time of the Dikin walk in a polytope -- a simple proof (Q1755831) (← links)
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence (Q2149565) (← links)
- On the Computational Complexity of Limit Cycles in Dynamical Systems (Q2800588) (← links)
- Integrality gaps for sparsest cut and minimum linear arrangement problems (Q2931416) (← links)
- Making evolution rigorous (Q2986858) (← links)
- Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing (Q3190696) (← links)
- Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration (Q3387758) (← links)
- Mixing Time of Markov Chains, Dynamical Systems and Evolution (Q4598202) (← links)
- Random Walks in Polytopes and Negative Dependence (Q4638105) (← links)
- On the Complexity of Constrained Determinantal Point Processes (Q5002639) (← links)
- Ranking with Fairness Constraints (Q5002698) (← links)
- (Q5002753) (← links)
- (Q5009519) (← links)
- On Geodesically Convex Formulations for the Brascamp-Lieb Constant (Q6300225) (← links)