Ajay Nerurkar

On Routing in Circulant Graphs

Bernard Mans, Jean-Pierre Seifert, Igor E. Shparlinski, 1999, COCOON.

Approximating the SVP to within a factor (1 + 1/dimepsilon) is NP-hard under randomized reductions

Jin-Yi Cai, Ajay Nerurkar, 1997, Electron. Colloquium Comput. Complex..

Hardness and hierarchy theorems for probabilistic quasi-polynomial time

Jin-Yi Cai, D. Sivakumar, Ajay Nerurkar, 1999, STOC '99.

A note on the non-NP-hardness of approximate lattice problems under general Cook reductions

Jin-Yi Cai, Ajay Nerurkar, 2000, Inf. Process. Lett..

Approximating the SVP to within a Factor (1+1/dimxi) Is NP-Hard under Randomized Reductions

Jin-Yi Cai, Ajay Nerurkar, Jin-Yi Cai, 1999, J. Comput. Syst. Sci..

Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions

Jin-Yi Cai, Ajay Nerurkar, 1998 .

Approximating the SVP to within a factor (1-1/dim/sup /spl epsiv//) is NP-hard under randomized conditions

Jin-Yi Cai, Ajay Nerurkar, Jin-Yi Cai, 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

An improved worst-case to average-case connection for lattice problems

Jin-Yi Cai, Ajay Nerurkar, Jin-Yi Cai, 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

Design of Uncheatable Benchmarks Using Complexity Theory

Jin-Yi Cai, Min-You Wu, Ajay Nerurkar, 1997 .

Approximating the Svp to within a Factor ?

Jin-Yi Cai, Ajay Nerurkar, 2007 .